Approximate sparse recovery: Optimizing time and measurements

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 475-484

  Gilbert, Anna C ^a   Li, Yi ^a   Porat, Ely ^b   Strauss, Martin J ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

approximation; embedding; sketching; sparse approximation; sublinear algorithms

Indexed keywords

ARBITRARY VECTORS; BEFORE AND AFTER; CONSTANT FACTORS; CONSTANT TIME; DECODING ALGORITHM; EUCLIDEAN; LOWER BOUNDS; MEASUREMENT MATRIX; RUNTIMES; SPARSE APPROXIMATIONS; SPARSE RECOVERY; SUBLINEAR ALGORITHM;

COMPUTATION THEORY; DECODING; MEASUREMENTS; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 77954693745     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806755     Document Type: Conference Paper

References (17)

1. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. J. Comput. System Sci., 58(1):137-147, 1999.
2. K. Do Ba, P. Indyk, E. Price, and D. Woodruff. Lower bounds for sparse recovery. In ACM SODA, page to appear, 2010.
3. 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.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. ICALP, 2002.
5. Raphaël Clifford, Klim Efremenko, Ely Porat, and Amir Rothschild. k-mismatch with don't cares. In ESA, pages 151-162, 2007.
6. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proc. ACM Principles of Database Systems, pages 296-306, 2003.
7. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. FSTTCS, 2004.
8. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for Compressed Sensing. In Proc. 40th Ann. Conf. Information Sciences and Systems, Princeton, Mar. 2006.
9. D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, Apr. 2006.
10. Devdatt Dubhashi, Volker Priebe, and Desh Ranjan. Negative dependence through the FKG inequality. In Research Report MPI-I-96-1-020, Max-Planck-Institut für Informatik, Saarbrucken, 1996.
11. Yaniv Erlich, Kenneth Chang, Assaf Gordon, Roy Ronen, Oron Navon, Michelle Rooks, and Gregory J. Hannon. Dna sudoku - harnessing high-throughput sequencing for multiplexed specimen analysis. Genome Research, 19:1243-1253, 2009.
12. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. One sketch for all: fast algorithms for compressed sensing. In ACM STOC 2007, pages 237-246, 2007.
13. 1 norm. FOCS, 2008.
14. D. Needell and J. A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comp. Harmonic Anal., 2008. To appear.
15. M. Wainwright. Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting. IEEE Transactions on Information Theory, 55(12):5728-5741, 2009.
16. Y. H. Zheng, N. P. Pitsianis, and D. J. Brady. Nonadaptive group testing based fiber sensor deployment for multiperson tracking. IEEE Sensors Journal, 6(2):490-494, 2006.
17. Y.H. Zheng, D. J. Brady, M. E. Sullivan, and B. D. Guenther. Fiber-optic localization by geometric space coding with a two-dimensional gray code. Applied Optics, 44(20):4306-4314, 2005.