Concept

Espace à quatre dimensions

Publications associées (707)

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

Ola Nils Anders Svensson, Adam Teodor Polak, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Xinrui Jia

We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A k-clustering is said to be explainable if it is given by a decision tree where each internal node splits data point ...

2021

Contact process under renewals II

We continue the study of renewal contact processes initiated in a companion paper, where we showed that if the tail of the interarrival distribution mu is heavier than t(-alpha) for some alpha < 1 (plus auxiliary regularity conditions) then the critical va ...

ELSEVIER2020

Large-scale automated investigation of free-falling paper shapes via iterative physical experimentation

Josephine Anna Eleanor Hughes

Free-falling paper shapes exhibit rich, complex and varied behaviours that are extremely challenging to model analytically. Physical experimentation aids in system understanding, but is time-consuming, sensitive to initial conditions and reliant on subject ...

Nature Research2020

The Advent of the 4D Mirror World

Frédéric Kaplan, Isabella Di Lenardo

The 4D Mirror World is considered to be the next planetary-scale information platform. This commentary gives an overview of the history of the converging trends that have progressively shaped this concept. It retraces how large-scale photographic surveys s ...

2020

Coordinate parameterisation and spectral method optimisation for Beltrami field solver in stellarator geometry

David Pfefferlé, Antoine Baillod, Ajay Kumar

The numerical solution of the stepped pressure equilibrium (Hudson et al 2012 Phys. Plasmas 19 112502) requires a fast and robust solver to obtain the Beltrami field in three-dimensional geometry such as stellarators. The spectral method implemented in the ...

IOP PUBLISHING LTD2020

Complexity of linear relaxations in integer programming

Matthias Schymura

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...

2020

A p-weighted limiter for the discontinuous Galerkin method on one-dimensional and two-dimensional triangular grids

Qian Wang

This paper presents an accuracy-preserving p-weighted limiter for discontinuous Galerkin methods on one-dimensional and two-dimensional triangular grids. The p-weighted limiter is the extension of the second-order WENO limiter by Li et al. [W. Li, J. Pan a ...

2020

Instability of a thin viscous film flowing under an inclined substrate: the emergence and stability of rivulets

François Gallaire, Gioele Mariano Nicolò Balestra, Pier Giuseppe Ledda, Gaëtan Pierre Clément Lerisson

We study the pattern formation of a thin film flowing under an inclined planar substrate. The phenomenon is studied in the context of the Rayleigh-Taylor instability using the lubrication equation. Inspired by experimental observations, we numerically stud ...

2020

Null-controllability, exact controllability, and stabilization of hyperbolic systems for the optimal time

Hoài-Minh Nguyên

In this paper, we discuss our recent works on the null-controllability, the exact controllability, and the stabilization of linear hyperbolic systems in one dimensional space using boundary controls on one side for the optimal time. Under precise and gener ...

2020

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search