Fetching the paper…
Reading the bibliography…
In this paper we consider under-determined systems of linear equations that have sparse solutions.
Geometria integral en espacios de curvatura constante
L. A. Santalo · 1952
Earlier work this paper cites.
On the geometrical moments of skew regular simplices in hyperspherical space; with some applications in geometry and mathematical statistics
H. Ruben · 1960
Earlier work this paper cites.
Non-linear angle-sum relations for polyhedral cones and polytopes
P. McMullen · 1975
Earlier work this paper cites.
Random projections of regular simplices
F. Afentranger and R. Schneider · 1992
Earlier work this paper cites.
Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem
A. M. Vershik and P. V. Sporyshev · 1992
Earlier work this paper cites.
Random projections of regular polytopes
K. Borocky and M. Henk · 1999
Earlier work this paper cites.
Sparse representations in unions of bases
R. Gribonval and M. Nielsen · 2003
Earlier work this paper cites.
Convex polytopes
B. Grunbaum · 2003
Earlier work this paper cites.
Neighborly polytopes and sparse solutions of underdetermined linear equations
D. Donoho · 2004
Earlier work this paper cites.
On the strong uniqueness of highly sparse expansions from redundant dictionaries
R. Gribonval and M. Nielsen · 2004
Earlier work this paper cites.
Greed is good: algorithmic results for sparse approximations
J. A. Tropp · 2004
Earlier work this paper cites.
Decoding by linear programming
E. Candes and T. Tao · 2005
Earlier work this paper cites.
Neighborliness of randomly-projected simplices in high dimensions
D. Donoho and J. Tanner · 2005
Earlier work this paper cites.
Sparse nonnegative solutions of underdetermined linear equations by linear programming
D. Donoho and J. Tanner · 2005
Earlier work this paper cites.
Sampling and reconstruction of signals with finite rate of innovation in the presence of noise
I. Maravic and M. Vetterli · 2005
Earlier work this paper cites.
Geometric approach to error correcting codes and reconstruction of signals
M. Rudelson and R. Vershynin · 2005
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E. Candes, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Combinatorial algorithms for compressed sensing
G. Cormode and S. Muthukrishnan · 2006
Cited alongside, same era.
High-dimensional centrally symmetric polytopes with neighborlines proportional to dimension
D. Donoho · 2006
Cited alongside, same era.
Thresholds for the recovery of sparse solutions via l 1 l_{1} minimization
D. Donoho and J. Tanner · 2006
Cited alongside, same era.
Algorithmic linear dimension reduction in the l1 norm for sparse vectors
A. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin · 2006
Enhancing sparsity by reweighted l1 minimization
E. Candes, M. Wakin, and S. Boyd · 2008
Later among the works it cites.
An alternating ell-1 approach to the compressed sensing problem
S. Chretien · 2008
Later among the works it cites.
Subspace pursuit for compressive sensing signal reconstruction
W. Dai and O. Milenkovic · 2008
Later among the works it cites.
Fast and effective sparse recovery using sparse random matrices
P. Indyk and M. Ruzic · 2008
Later among the works it cites.
Explicit measurements with almost optimal thresholds for compressed sensing
F. Parvaresh and B. Hassibi · 2008
Later among the works it cites.
Stable sparse approximation via nonconvex optimization
R. Saab, R. Chartrand, and O. Yilmaz · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
D. L. Donoho, Y. Tsaig, I. Drori, and J.L. Starck · 2007
Cited alongside, same era.
One sketch for all: fast algorithms for compressed sensing
A. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin · 2007
Cited alongside, same era.
Highly sparse representations from dictionaries are unique and independent of the sparseness measure
R. Gribonval and M. Nielsen · 2007
Cited alongside, same era.
Signal recovery from random measurements via orthogonal matching pursuit
J. Tropp and A. Gilbert · 2007
Cited alongside, same era.
Efficient compressive sensing with determinstic guarantees using expander graphs
W. Xu and B. Hassibi · 2007
Cited alongside, same era.
A frame construction and a universal distortion bound for sparse representations
M. Akcakaya and V. Tarokh · 2008
Cited alongside, same era.
Later among the works it cites.
Thresholded basis pursuit: Quantizing linear programming solutions for optimal support recovery and approximation in compressed sensing
V. Saligrama and M. Zhao · 2008
Later among the works it cites.
R. Adamczak, A. E. Litvak, A. Pajor, and N. Tomczak-Jaegermann · 2009
Later among the works it cites.
Message-passing algorithms for compressed sensing
D. Donoho, A. Maleki, and A. Montanari · 2009
Later among the works it cites.
Counting faces of randomly projected polytopes when the projection radically lowers dimension
D. Donoho and J. Tanner · 2009
Later among the works it cites.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
D. Needell and J. A. Tropp · 2009
Later among the works it cites.
Unifrom uncertainly principles and signal recovery via regularized orthogonal matching pursuit
D. Needell and R. Vershynin · 2009
Later among the works it cites.
A simple performance analysis of ℓ 1 \ell_{1} -optimization in compressed sensing
M. Stojnic · 2009
Later among the works it cites.
Various thresholds for ℓ 1 \ell_{1} -optimization in compressed sensing
M. Stojnic · 2009
Later among the works it cites.