暂无分享,去创建一个
Alexandros G. Dimakis | Weiyu Xu | Babak Hassibi | M. Amin Khajehnejad | A. Dimakis | B. Hassibi | Weiyu Xu | M. Khajehnejad
[1] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[2] Piotr Indyk,et al. Sparse Recovery Using Sparse Matrices , 2010, Proceedings of the IEEE.
[3] Nathan Linial,et al. How Neighborly Can a Centrally Symmetric Polytope Be? , 2006, Discret. Comput. Geom..
[4] Arkadi Nemirovski,et al. On sparse representation in pairs of bases , 2003, IEEE Trans. Inf. Theory.
[5] Weiyu Xu,et al. Compressed sensing - probabilistic analysis of a null-space characterization , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[6] D. Donoho,et al. Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[7] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[8] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[9] Weiyu Xu,et al. Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.
[10] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[11] James R. Lee,et al. Almost Euclidean subspaces of e N 1 via expander codes , 2008, SODA 2008.
[12] Venkatesan Guruswami,et al. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals , 2008, APPROX-RANDOM.
[13] D. Spielman,et al. Expander codes , 1996 .
[14] Max Buot. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2006 .
[15] G. Stewart. Perturbation theory for the singular value decomposition , 1990 .
[16] A. Robert Calderbank,et al. Efficient and Robust Compressed Sensing using High-Quality Expander Graphs , 2008, ArXiv.
[17] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[18] Babak Hassibi,et al. Recovering Sparse Signals Using Sparse Measurement Matrices in Compressed DNA Microarrays , 2008, IEEE Journal of Selected Topics in Signal Processing.
[19] B. Hassibi,et al. Compressed sensing over the Grassmann manifold: A unified analytical framework , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[20] J. Kruskal. Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .
[21] B. Hassibi,et al. Further Results on Performance Analysis for Compressive Sensing Using Expander Graphs , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.
[22] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[23] A. Bruckstein,et al. A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique , 2007 .
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[25] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.