论文信息 - Deterministic constructions of compressed sensing matrices - 字舞流文

Deterministic constructions of compressed sensing matrices

Ronald A. DeVore | R. DeVore

[1] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .

[2] R. DeVore,et al. The Johnson-Lindenstrauss Lemma Meets Compressed Sensing , 2006 .

[3] R. DeVore. Optimal computation , 2006 .

[4] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[5] G. Lorentz,et al. Constructive approximation : advanced problems , 1996 .

[6] E. Gluskin. NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS , 1984 .

[7] R. DeVore,et al. Mixed norm $n$-widths , 1980 .