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.
We consider a general class of SPDEs in mathbb{R}^d driven by a Gaussian spatially homogeneous noise which is white in time. We provide sufficient conditions on the coefficients and the spectral measure associated to the noise ensuring that the density of ...
Price's Law states that linear perturbations of a Schwarzschild black hole fall off as t−2ℓ−3 for t→∞ provided the initial data decay sufficiently fast at spatial infinity. Moreover, if the perturbations are initially static (i.e., their ...
We develop a doubly spectral representation of a stationary functional time series, and study the properties of its empirical version. The representation decomposes the time series into an integral of uncorrelated frequency components (Cramer representatio ...
The Wigner phase operator (WPO) is identified as an operator valued measure (OVM) and its eigenstates are obtained. An operator satisfying the canonical commutation relation with the Wigner phase operator is also constructed and this establishes a Wigner d ...
We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density operator, which gen ...
We introduce a unified optimization framework for geometry processing based on shape constraints. These constraints preserve or prescribe the shape of subsets of the points of a geometric data set, such as polygons, one-ring cells, volume elements, or featu ...
Compressed sensing (CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse background-subtracted silhouettes and show the usefulness of such an approach ...
A continuous interior penalty hp-finite element method that penalizes the jump of the discrete solution across mesh interfaces is introduced. Error estimates are obtained for first-order and advection-dominated transport operators. The analysis relies on t ...
The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller num ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
An attractive formulation of the sampling problem is based on the principle of a consistent signal reconstruction. The requirement is that the reconstructed signal is indistinguishable from the input in the sense that it yields the exact same measurements. ...
Institute of Electrical and Electronics Engineers2007
