Combining geometry and combinatorics: A unified approach to sparse signal recovery
暂无分享,去创建一个
Piotr Indyk | Howard J. Karloff | Anna C. Gilbert | Martin Strauss | Radu Berinde | A. Gilbert | P. Indyk | M. Strauss | H. Karloff | R. Berinde | Radu Berinde
[1] Yishay Mansour,et al. Randomized Interpolation and Approximation of Sparse Polynomials , 1992, SIAM J. Comput..
[2] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[3] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[4] Moses Charikar,et al. Finding frequent items in data streams , 2002, Theor. Comput. Sci..
[5] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[6] Sudipto Guha,et al. Near-optimal sparse fourier representations via sampling , 2002, STOC '02.
[7] Sudipto Guha,et al. Fast, small-space algorithms for approximate histogram maintenance , 2002, STOC '02.
[8] V. Temlyakov. Nonlinear Methods of Approximation , 2003, Found. Comput. Math..
[9] George Varghese,et al. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.
[10] S. Muthukrishnan,et al. One-Pass Wavelet Decompositions of Data Streams , 2003, IEEE Trans. Knowl. Data Eng..
[11] Richard G. Baraniuk,et al. Fast reconstruction of piecewise smooth signals from random projections , 2005 .
[12] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[13] J. Tropp,et al. SIGNAL RECOVERY FROM PARTIAL INFORMATION VIA ORTHOGONAL MATCHING PURSUIT , 2005 .
[14] Richard G. Baraniuk,et al. Sudocodes ߝ Fast Measurement and Reconstruction of Sparse Signals , 2006, 2006 IEEE International Symposium on Information Theory.
[15] Richard G. Baraniuk,et al. A new compressive imaging camera architecture using optical-domain compression , 2006, Electronic Imaging.
[16] Graham Cormode,et al. Combinatorial Algorithms for Compressed Sensing , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[17] Richard Baraniuk,et al. Compressed Sensing Reconstruction via Belief Propagation , 2006 .
[18] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[19] Joel A. Tropp,et al. Algorithmic linear dimension reduction in the l_1 norm for sparse vectors , 2006, ArXiv.
[20] D. Donoho,et al. Thresholds for the Recovery of Sparse Solutions via L1 Minimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[21] R. Vershynin,et al. One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.
[22] Cynthia Dwork,et al. The price of privacy and the limits of LP decoding , 2007, STOC '07.
[23] Weiyu Xu,et al. Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.
[24] V. Temlyakov,et al. A remark on Compressed Sensing , 2007 .
[25] Ronald A. DeVore,et al. Deterministic constructions of compressed sensing matrices , 2007, J. Complex..
[26] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[27] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[28] V. Chandar. A Negative Result Concerning Explicit Matrices With The Restricted Isometry Property , 2008 .
[29] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity , 2008, ArXiv.
[30] Ting Sun,et al. Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..
[31] Piotr Indyk. Explicit constructions for compressed sensing of sparse signals , 2008, SODA '08.
[32] Venkatesan Guruswami,et al. Almost Euclidean subspaces of ℓ1N VIA expander codes , 2007, SODA '08.
[33] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..
[34] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[35] Richard G. Baraniuk,et al. Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.
[36] Piotr Indyk,et al. Sparse Recovery Using Sparse Random Matrices , 2010, LATIN.
[37] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.