Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
How many samples are sufficient to guarantee that the eigenvectors and eigenvalues of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite second moment and ...
Extensive amenability is a property of group actions which has recently been used as a tool to prove amenability of groups. We study this property and prove that it is preserved under a very general construction of semidirect products. As an application, w ...
In this paper we prove an existence result for the following singular elliptic system {z > 0 in Omega, z is an element of W-0(iota,p)(Omega) : -Delta(p)z = a(x)z(q-iota)u(theta) , u > 0 in Omega, u is an element of W-0(iota,p)(Omega) : -Delta(p)u = b(x)z(q ...
We study joint chance constraints where the distribution of the uncertain parameters is only known to belong to an ambiguity set characterized by the mean and support of the uncertainties and by an upper bound on their dispersion. This setting gives rise t ...
Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation provided ...
Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l(2)-norm dual window, is widely used. This window function however, might lack desirable properties, e. g. good time-fre ...
We propose a new and low per-iteration complexity first-order primal-dual optimization framework for a convex optimization template with broad applications. Our analysis relies on a novel combination of three classic ideas applied to the primal-dual gap fu ...
We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinato ...
Kaiser-Bessel window functions are frequently used to discretize tomographic problems because they have two desirable properties: 1) their short support leads to a low computational cost and 2) their rotational symmetry makes their imaging transform indepe ...
This work focuses on the development of a posteriori error estimates for fourth-order, elliptic, partial differential equations. In particular, we propose a novel algorithm to steer an adaptive simulation in the context of Kirchhoff plates and Kirchhoff-Lo ...