Combinatorial Algorithms for Compressed Sensing
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 280-294
- https://doi.org/10.1007/11780823_22
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Improved time bounds for near-optimal sparse Fourier representationsPublished by SPIE-Intl Soc Optical Eng ,2005
- Stable signal recovery from incomplete observationsPublished by SPIE-Intl Soc Optical Eng ,2005
- Proving hard-core predicates using list decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Near-optimal sparse fourier representations via samplingPublished by Association for Computing Machinery (ACM) ,2002
- Randomized Interpolation and Approximation of Sparse PolynomialsSIAM Journal on Computing, 1995
- Learning Decision Trees Using the Fourier SpectrumSIAM Journal on Computing, 1993
- Combinatorial Group Testing and its ApplicationsSeries on Applied Mathematics, 1993
- Constructive ApproximationPublished by Springer Nature ,1993
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964