On the role of sparsity in Compressed Sensing and random matrix theory
暂无分享,去创建一个
[1] J. Kuelbs. Probability on Banach spaces , 1978 .
[2] A. Edelman. Eigenvalues and condition numbers of random matrices , 1988 .
[3] Stanislaw J. Szarek,et al. Condition numbers of random matrices , 1991, J. Complex..
[4] M. Talagrand,et al. Probability in Banach Spaces: Isoperimetry and Processes , 1991 .
[5] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[6] M. Rudelson,et al. The Littlewood-Offord problem and invertibility of random matrices , 2007, math/0703503.
[7] M. Rudelson,et al. The least singular value of a random square matrix is O(n−1/2) , 2008, 0805.3407.
[8] M. Rudelson,et al. The smallest singular value of a random rectangular matrix , 2008, 0802.3956.
[9] R. Vershynin. Spectral norm of products of random and deterministic matrices , 2008, 0812.2432.
[10] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[11] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[12] T. Tao,et al. Random Matrices: the Distribution of the Smallest Singular Values , 2009, 0903.0614.