Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation
Publications associées (79)
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.
We prove a general subconvex bound in the level aspect for Rankin–Selberg L-functions associated with two primitive holomorphic or Maass cusp forms over Q. We use this bound to establish the equidistribution of incomplete Galois orbits of Heegner points on ...
This manual will be useful for people looking to extend R with the C compiled code. The motivation for using the C interface with R may be bidirectional. For statisticians programming mainly in R, an interface to C provides fast execution of code and bette ...
In this paper, we review half a century of research on the design of systems displaying (physical) self-assembly of macroscopic components. We report on the experience gained in the design of 21 such systems, exhibiting components ranging from passive mech ...
In this Note we prove that in one space dimension, the symmetric discontinuous Galerkin method for second order elliptic problems is stable for polynomial orders p≥2 without using any stabilization parameter. The method yields optimal convergence rat ...
A novel method for inverting time-resolved line-integrated interferometric plasma density measurements is described. The method uses singular value decomposition of local density profiles from Thomson scattering measurements obtained at low sampling rates ...
Let G a locally compact group, H a closed subgroup and 1 < p < ∞. It's well-known that the restriction of the functions from G to H is a surjective linear contraction from Ap(G) onto Ap(H). We prove, when H is amenable, that every element in Ap(H) with com ...
The purpose of this paper is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit with some structured dictionaries for ``simple'' functions in finite or infinite dimension. Our results are based on an extension of ...
The main goal of this article is to analyze a three-dimensional model for stress and velocity fields in grounded glaciers and ice sheets including the role of normal deviatoric stress gradients. This model leads to a nonlinear system of stationary partial ...
This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymp- totic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join sch ...
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, nonuniform splines or piecewise polynomials, and call the number of degrees of freedom per unit ...
Institute of Electrical and Electronics Engineers2007