Combinatorial Algorithms for Compressed Sensing
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 280-294
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Improved time bounds for near-optimal sparse Fourier representations2005
- Stable signal recovery from incomplete observations2005
- Proving hard-core predicates using list decoding2004
- Fast, small-space algorithms for approximate histogram maintenance2002
- Near-optimal sparse fourier representations via sampling2002
- 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 Applications1993
- Constructive Approximation1993
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964