Sciweavers

107 search results - page 18 / 22
» Lower Bounds for Sparse Recovery
Sort
View
FOCM
2011
188views more  FOCM 2011»
12 years 11 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 7 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
DC
2010
13 years 7 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
13 years 2 months ago
Concentration of measure inequalities for compressive Toeplitz matrices with applications to detection and system identification
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...
Borhan Molazem Sanandaji, Tyrone L. Vincent, Micha...
FOCM
2010
108views more  FOCM 2010»
13 years 6 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward