107 search results - page 6 / 22 » Lower Bounds for Sparse Recovery |
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
NIPS
2003
13 years 8 months ago
2003
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
JPDC
2006
13 years 6 months ago
2006
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...