(1 + ε)-approximate sparse recovery

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 295-304

  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

COMPRESSIVE SENSING; CONSTANT FACTORS; LOWER BOUNDS; POLY-LOGARITHMIC FACTORS; RECOVERY ALGORITHMS; SPARSE RECOVERY;

ALGORITHMS; COMPUTER SCIENCE; PROBABILITY DISTRIBUTIONS;

RECOVERY;

EID: 84861587718     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.92     Document Type: Conference Paper

References (19)

1. Z. Bar-Yossef, "The complexity of massive data set computations,"Ph.D. dissertation, UC Berkeley, 2002.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, "An information statistics approach to data stream and communication complexity," J. Comput. Syst. Sci., vol. 68, no. 4, pp. 702-732, 2004.
3. M. Braverman and A. Rao, "Information equals amortized communication," in STOC, 2011.
4. A. Bruex, A. Gilbert, R. Kainkaryam, J. Schiefelbein, and P. Woolf, "Poolmc: Smart pooling of mRNA samples in microarray experiments," BMC Bioinformatics, 2010.
5. E. J. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math., vol. 59, no. 8, pp. 1208-1223, 2006.
6. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," ICALP, 2002.
7. G. Cormode and S. Muthukrishnan, "Improved data stream summaries: The count-min sketch and its applications,"LATIN, 2004.
8. -, "Combinatorial algorithms for compressed sensing,"Sirocco, 2006.
9. -, "Summarizing and mining skewed data streams," in SDM, 2005.
10. K. Do Ba, P. Indyk, E. Price, and D. Woodruff, "Lower bounds for sparse recovery," SODA, 2010.
11. D. L. Donoho, "Compressed Sensing," IEEE Trans. Info. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
12. S. Foucart, A. Pajor, H. Rauhut, and T. Ullrich, "The gelfand widths of lp-balls for 0 < p ≤ 1," 2010.
13. A. C. Gilbert, Y. Li, E. Porat, and M. J. Strauss, "Approximate sparse recovery: optimizing time and measurements," in STOC, 2010, pp. 475-484.
14. P. Indyk and M. Ruzic, "Near-optimal sparse recovery in the l1 norm," in FOCS, 2008, pp. 199-207.
15. T. Jayram, "Unpublished manuscript," 2002.
16. S. Muthukrishnan, "Data streams: Algorithms and applications), "FTTCS, 2005.
17. N. Shental, A. Amir, and O. Zuk, "Identification of rare alleles and their carriers using compressed se(que)nsing," Nucleic Acids Research, vol. 38(19), pp. 1-22, 2010.
18. J. Treichler, M. Davenport, and R. Baraniuk, "Application of compressive sensing to the design of wideband signal acquisition receivers," In Proc. U.S./Australia Joint Work. Defense Apps. of Signal Processing (DASP), 2009.
19. M. J. Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5728-5741, 2009.