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.
Understanding how things break and slide is of paramount importance to describe the dynamics of a broad range of physical systems. This includes day-to-day problems such as the breaking of a glass of wine or the sliding of skis on snow, but also engineerin ...
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...
We study equidistribution properties of translations on nilmanifolds along functions of polynomial growth from a Hardy field. More precisely, if X=G/Γ is a nilmanifold, a1,…,ak∈G are commuting nilrotations, and f1,…,fk are funct ...
We consider the problem of finding an optimal transport plan between an absolutely continuous measure and a finitely supported measure of the same total mass when the transport cost is the unsquared Euclidean distance. We may think of this problem as close ...
In this thesis we study a number of problems in Discrete Combinatorial Geometry in finite spaces. The contents in this thesis are structured as follows: In Chapter 1 we will state the main results and the notations which will be used throughout the thesis. ...
In this note, we use methods from spectral graph theory to obtain bounds on the number of incidences between k-planes and h-planes in F-q(d), which generalizes a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove tha ...
Let P be a finite point set in the plane. A \emph{c-ordinary triangle} in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P. Motivated by a question o ...
Several models exist for the simulation of vascular flows; they span from simple circuit models to full three-dimensional ones that take into account detailed features of the blood and of the arterialwall. Eachmodel comeswith both benefits and drawbacks, t ...
Energy piles are subjected to short- and long-term cyclic thermal loads due to their unique role as heat exchangers. Their response to monotonic temperature change has been investigated by various researchers from both experimental and numerical points of ...
The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...
