Lower bounds for sparse recovery

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1190-1197

  Ba, Khanh Do ^a   Indyk, Piotr ^a   Price, Eric ^a   Woodruff, David P ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LOWER BOUNDS; N-MATRIX; RECOVERY ALGORITHMS; SPARSE RECOVERY;

RECOVERY;

EID: 77951692788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.95     Document Type: Conference Paper

References (22)

1. [BGI+08] R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: a unified approach to sparse signal recovery. Allerton, 2008.
2. [BYJKK04] Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar. The sketching complexity of pattern matching. RANDOM, 2004.
3. [CCFC04] M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1):3-15, 2004.
4. [CM05] G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005.
5. [CRT06] E. J. Candès, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8):1208-1223, 2006.
6. [CW09] K. L. Clarkson and D. P. Woodruff. Numerical linear algebra in the streaming model. In STOC, pages 205-214, 2009.
7. +08] M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk. Single-pixel imaging via compressive sampling. IEEE Signal Processing Magazine, 2008.
8. [DM08] W. Dai and O. Milenkovic. Weighted superimposed codes and constrained integer compressed sensing. Preprint, 2008.
9. [Don06] D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, Apr. 2006.
10. n. IEEE Tran. on Information Theory, 34(4):877-880, 1988.
11. [FR99] Z. Füredi and M. Ruszinkó. An improved upper bound of the rate of euclidean superimposed codes. IEEE Trans, on Information Theory, 45(2):799-802, 1999.
12. [GSS08] S. Ganguly, A. N. Singh, and S. Shankar. Finding frequent items over general update streams. In SSDBM, pages 204-221, 2008.
13. [IN07] P. Indyk and A. Naor. Nearest neighbor preserving embeddings. ACM Trans. on Algorithms, 3(3), Aug. 2007.
14. [Ind07] P. Indyk. Sketching, streaming and sublinear-space algorithms. Graduate course notes, available at http://stellar.mit.edu/S/course/6/fa07/6. 895/, 2007.
15. [KN97] E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
16. [KNR99] I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
17. [KNW10] D. Kane, J. Nelson, and D. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, 2010.
18. [KT07] B. S. Kashin and V. N. Temlyakov. A remark on compressed sensing. Preprint, 2007.
19. [MNSW98] P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. Comput Syst Sci., 57(1):37-49, 1998.
20. [Mut03] S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rutgers.edu/~muthu/stream- 1-1.ps, 2003.
21. [vL98] J.H. van Lint. Introduction to coding theory. Springer, 1998.
22. [Wai07] M. Wainwright. Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting. IEEE Int'l Symp. on Information Theory, 2007.