| Sparse nonnegative solution of underdetermined linear equations by linear programming DL Donoho, J Tanner Proceedings of the National Academy of Sciences of the United States of …, 2005 | 679 | 2005 |
| Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing D Donoho, J Tanner Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2009 | 508 | 2009 |
| Counting faces of randomly-projected polytopes when the projection radically lowers dimension DL Donoho, J Tanner J. Amer. Math. Soc 22 (1), 1-53, 2009 | 494 | 2009 |
| Neighborliness of randomly projected simplices in high dimensions DL Donoho, J Tanner Proceedings of the National Academy of Sciences 102 (27), 9452-9457, 2005 | 461 | 2005 |
| Precise undersampling theorems DL Donoho, J Tanner Proceedings of the IEEE 98 (6), 913-924, 2010 | 392 | 2010 |
| Counting the faces of randomly-projected hypercubes and orthants, with applications DL Donoho, J Tanner Discrete & computational geometry 43, 522-541, 2010 | 232 | 2010 |
| Compressed sensing: How sharp is the restricted isometry property JD Blanchard, C Cartis, J Tanner Arxiv preprint arXiv:1004.5026, 2010 | 203* | 2010 |
| Normalized iterative hard thresholding for matrix completion J Tanner, K Wei SIAM J. on Scientific Computing 35 (5), S104-S125, 2013 | 161 | 2013 |
| Low rank matrix completion by alternating steepest descent methods J Tanner, K Wei Applied and Computational Harmonic Analysis, 2015 | 130 | 2015 |
| Thresholds for the recovery of sparse solutions via l1 minimization DL Donoho, J Tanner 2006 40th Annual Conference on Information Sciences and Systems, 202-206, 2006 | 129 | 2006 |
| Robust reprojection methods for the resolution of the Gibbs phenomenon A Gelb, J Tanner Applied and Computational Harmonic Analysis 20 (1), 3-25, 2006 | 117 | 2006 |
| CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion JD Blanchard, J Tanner, K Wei Information and Inference: A Journal of the IMA 4 (4), 289-327, 2015 | 100 | 2015 |
| Improved bounds on restricted isometry constants for Gaussian matrices B Bah, J Tanner Arxiv preprint arXiv:1003.3299, 2010 | 96 | 2010 |
| Adaptive mollifiers for high resolution recovery of piecewise smooth data from its spectral information E Tadmor, J Tanner Foundations of Computational Mathematics 2, 155-189, 2002 | 95 | 2002 |
| Identification of matrices having a sparse representation GE Pfander, H Rauhut, J Tanner IEEE Transactions on Signal Processing 56 (11), 5376-5388, 2008 | 88 | 2008 |
| Princeton companion to applied mathematics NJ Higham, MR Dennis, P Glendinning, PA Martin, F Santosa, J Tanner Princeton University Press, 2015 | 85 | 2015 |
| Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling DL Donoho, J Tanner IEEE Transactions on Information Theory 56 (4), 2002-2016, 2010 | 81 | 2010 |
| Phase transitions for greedy sparse approximation algorithms JD Blanchard, C Cartis, J Tanner, A Thompson Applied and Computational Harmonic Analysis 30 (2), 188-203, 2011 | 70 | 2011 |
| Iterative reconstruction of fluorine-18 SPECT using geometric point response correction GL Zeng, GT Gullberg, C Bai, PE Christian, F Trisjono, EVR Di Bella, ... Journal of Nuclear Medicine 39 (1), 124-130, 1998 | 68 | 1998 |
| Optimal filter and mollifier for piecewise smooth spectral data J Tanner Mathematics of computation 75 (254), 767-790, 2006 | 64 | 2006 |
Jeffrey D. BlanchardGrinnell College在 math.grinnell.edu 的电子邮件经过验证
