• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Decoding by Linear Programming (2004)

Cached

  • Download as a PDF

Download Links

  • [www.acm.caltech.edu]
  • [www.l1-magic.org]
  • [www-stat.stanford.edu]
  • [www-stat.stanford.edu]
  • [statweb.stanford.edu]
  • [www-stat.stanford.edu]
  • [ipg.epfl.ch]
  • [authors.library.caltech.edu]
  • [home.ustc.edu.cn]
  • [home.ustc.edu.cn]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Emmanuel J. Candès , Terence Tao
Citations:1388 - 16 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Citations

14063 Computers and Intractability: A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
7438 Convex Optimization - Boyd, Vandenberghe - 2004
2712 Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
2612 Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information - Candès, Romberg, et al. - 2006
1504 Near optimal signal recovery from random projections: Universal encoding strategies - Candès, Tao - 2006
979 Aspects of multivariate statistical theory - Muirhead - 1982
911 Greed is good: Algorithmic results for sparse approximation - Tropp
627 Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 norm minimization - Donoho, Elad
593 The Concentration of Measure Phenomenon - Ledoux - 2000
580 Uncertainty principles and ideal atomic decomposition - Donoho, Huo - 2001
566 For most large underdetermined systems of linear equations, the minimal ell-1 norm solution is also the sparsest solution - Donoho - 2006
554 Sparse approximate solutions to linear systems - Natarajan - 1995
419 On the distribution of the largest eigenvalue in principal components analysis - Johnstone
335 Sparse representations in unions of bases - Gribonval, Nielsen
246 A generalized uncertainty principle and sparse representation in pairs of bases - Elad, Bruckstein - 2002
207 Local operator theory, randommatrices and Banach spaces. Handbook of the geometry of Banach spaces - Davidson, Szarek - 2001
183 Using linear programming to decode binary linear codes - Feldman, Wainwright, et al. - 2005
181 Quantitative robust uncertainty principles and optimally sparse decompositions - Candes, Romberg - 2006
151 A limit theorem for the norm of random matrices - Geman - 1980
116 Decoding error-correcting codes via linear programming,” - Feldman - 2003
86 Least Absolute Deviations: Theory, Applications, and Algorithms - Bloomfield - 1983
68 LP decoding corrects a constant fraction of errors - Feldman, Malkin, et al. - 2007
64 The smallest eigenvalue of a large dimensional Wishart matrix. - Silverstein - 1985
61 Limit of the smallest eigenvalue of a large-dimensional sample covariance matrix - Bai, Yin - 1993
59 The distribution of eigenvalues in certain sets of random matrices, - Marchenko, Pastur - 1967
58 Condition numbers of random matrices,” - Szarek - 1991
27 LP decoding achieves capacity - Feldman, Stein - 2005
17 The limiting empirical measure of multiple discriminant ratios - Wachter - 1980
9 Compressed sensing.” Unpublished manuscript - Donoho - 2004
7 New Results about Random Covariance Matrices and Statistical Applications. Stanford Ph - Karoui - 2004
2 Large covariance matrices. Third 2004 Wald Lecture - Johnstone - 2004
1 decoding achieves capacity,” presented at the ACM-SIAM Symp. Discrete Algorithms - “LP - 2005
1 Authorized licensed use limited to - Anal - 2001
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University