Combinatorial algorithms for compressed sensing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4056 LNCS, Issue , 2006, Pages 280-294

  Cormode, Graham ^a   Muthukrishnan, S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; INFORMATION THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING;

LEARNING THEORY; MEASUREMENT MATRIX; RECONSTRUCTION ALGORITHM; STREAMING ALGORITHMS;

SIGNAL RECONSTRUCTION;

EID: 33746345633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780823_22     Document Type: Conference Paper

References (25)

1. A. Akavia, S. Goldwasser, and S. Safra. Proving hard-core predicates by list decoding. In FOCS, pages 146-157, 2003.
2. E. Candès, J. Romberg, and T. Tao. Stable signals recovery from incomplete and inaccurate measurements. Unpublished Manuscript, 2005.
3. E. Candès, M. Rudelson, T. Tao, and R. Vershynin. Error correction via linear programming. In FOCS, 2005.
4. E. Candès and T. Tao. Near optimal signal recovery from random projections and universal encoding strategies. http://arxiv.org/abs/math.CA/ 0410542.2004.
5. A. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. In SODA, 2001.
6. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In ACM PODS, 2003.
7. G. Cormode and S. Muthukrishnan. Towards an algorithmic theory of compressed sensing. DIMACS Tech Report 2005-25, 2005.
8. R. Devore and G. G. Lorentz. Constructive Approximation, volume 303. Springer Grundlehren, 1993.
9. D. Donoho. Compressed sensing. Unpublished Manuscript, 2004.
10. D-Z Du and F.K. Hwang. Combinatorial Group Testing and Its Applications, volume 3 of Series on Applied Mathematics. World Scientific, 1993.
11. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In STOC, 2002.
12. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near-optimal sparse Fourier representation via sampling. In STOC, 2002.
13. A. Gilbert, S. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal sparse Fourier representations. In SPIE Conference on Wavelets, 2005.
14. J. Haupt and R. Nowak. Signal reconstruction from noisy random projections. Unpublished Manuscript, 2005.
15. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
16. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In SODA, 2002.
17. P. Indyk. Personal communication, 2005.
18. Integration of Sensing and Processing, Workshop at IMA, 2005.
19. W.H. Kautz and R.R. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on on Information Theory, 10:363-377, 1964.
20. E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. SIAM Journal on Computing, 22(6): 1331-1348, 1993.
21. Y. Mansour. Randomized interpoloation and approximation of sparse polynomials. SIAM Journal of Computing, 24(2), 1995.
22. Compressed sensing website. http://www.dsp.ece.rice.edu/CS/.
23. M. Rudelson and R. Vershynin. Geometric approach to error correcting codes and reconstruction of signals. Unpublished Manuscript, 2005.
24. J. Tropp and A. Gilbert. Signal recovery from partial information via orthogonal matching pursuit. Unpublished Manuscript, 2005.
25. Y. Tsaig and D. Donoho. Extensions of compressed sensing. Unpublished Manuscript, 2004.