Combinatorial algorithms for compressed sensing

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 198-201

  Cormode, Graham ^a   Muthukrishnan, S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; ERROR ANALYSIS; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COMPRESSED SENSING; LINEAR MEASUREMENTS; WORST CASE ERROR;

DATA COMPRESSION;

EID: 44049103219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286461     Document Type: Conference Paper

References (21)

1. D. Donoho, "Compressed sensing," http://www-stat.stanford.edu/ ~donoho/Reports/2004/CompressedSensing091604.pdf, 2004, unpublished Manuscript.
2. E. Candès and T. Tao, "Near optimal signal recovery from random projections and universal encoding strategies," arXiv, http://arxiv.org/abs/math.CA/0410542, Tech. Rep. math.CA/0410542, 2004.
3. M. Rudelson and R. Vershynin, "Geometric approach to error correcting codes and reconstruction of signals," http://www.math.ucdavis. edu/~vershynin/papers/ecc.pdf, 2005, unpublished Manuscript.
4. E. Kushilevitz and Y. Mansour, "Learning decision trees using the fourier spectrum," SIAM Journal on Computing, vol. 22, no. 6, pp. 1331-1348, 1993.
5. Y. Mansour, "Randomized interpoloation and approximation of sparse polynomials," SIAM Journal of Computing, vol. 24, no. 2, 1995.
6. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss, "Fast, small-space algorithms for approximate histogram maintenance," in Proceedings of the ACM Symposium on Theory of Computing, 2002, pp. 389-398.
7. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss, "Near-optimal sparse Fourier representation via sampling," in Proceedings of the ACM Symposium on Theory of Computing, 2002.
8. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," in Proceedings of ACM Principles of Database Systems, 2003, pp. 296-306.
9. A. Akavia, S. Goldwasser, and S. Safra, "Proving hard-core predicates by list decoding," in IEEE Conference on Foundations of Computer Science, 2003, pp. 146-157.
10. R. Devore and G. G. Lorentz, Constructive Approximation. Springer Grundlehren, 1993, vol. 303.
11. Y Tsaig and D. Donoho, "Extensions of compressed sensing," http://www-stat.stanford.edu/~donoho/Reports/2004/ExtCS-10-22-04.pdf, 2004, unpublished Manuscript.
12. "SPARS05 Signal Processing with Adaptative Sparse Structured Representations," 2005, http://www.irisa.fr/manifestations/2005/SPARS05/.
13. "Compressed sensing website," http://www.dsp.ece.rice.edu/CS/.
14. E. Candès, M. Rudelson, T. Tao, and R. Vershynin, "Error correction via linear programming," in IEEE Conference on Foundations of Computer Science, 2005.
15. E. Candès, J. Romberg, and T. Tao, "Stable signals recovery from incomplete and inaccurate measurements," http://www.acm.caltech.edu/ emmanuel/papers/StableRecovery.pdf, 2005, unpublished Manuscript.
16. "IEEE International Conference on Acoustics, Speech, and Signal Processing," 2005, http://www.icassp2005.com/.
17. "Integration of Sensing and Processing," 2005, http://www.ima.umn.edu/2005-2006/W12.5-9.05/.
18. A. Gilbert, S. Muthukrishnan, and M. Strauss, "Improved time bounds for near-optimal sparse Fourier representations," in SPIE Conference on Wavelets, 2005.
19. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," http://homepages.cae.wisc.edu/~jhaupt/Publications/ RandomProjections05.pdf, 2005, unpublished Manuscript.
20. G. Cormode and S. Muthukrishnan, "Towards an algorithmic theory of compressed sensing," Center for Discrete Mathematics and Computer Science (DIMACS), Tech. Rep. 2005-25, 2005.
21. P. Indyk, "Personal communication," 2005.