Jared Tanner, Ph.D - Publications

Affiliations: 
University of Oxford University of Oxford, Oxford, United Kingdom 
Area:
Compressed Sensing, Matrix Completion, Stochastic Geometry, Approximation Theory
Website:
http://people.maths.ox.ac.uk/tanner/

21 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Tanner J, Wei K. Low rank matrix completion by alternating steepest descent methods Applied and Computational Harmonic Analysis. 40: 417-429. DOI: 10.1016/j.acha.2015.08.003  1
2015 Blanchard JD, Tanner J, Wei K. Conjugate gradient iterative hard thresholding: Observed noise stability for compressed sensing Ieee Transactions On Signal Processing. 63: 528-537. DOI: 10.1109/TSP.2014.2379665  1
2015 Blanchard JD, Tanner J. Performance comparisons of greedy algorithms in compressed sensing Numerical Linear Algebra With Applications. 22: 254-282. DOI: 10.1002/nla.1948  1
2014 Bah B, Tanner J. Bounds of restricted isometry constants in extreme asymptotics: Formulae for Gaussian matrices Linear Algebra and Its Applications. 441: 88-109. DOI: 10.1016/j.laa.2012.11.024  1
2013 Tanner J, Wei K. Normalized iterative hard thresholding for matrix completion Siam Journal On Scientific Computing. 35: S104-S125. DOI: 10.1137/120876459  1
2013 Bah B, Tanner J. Vanishingly sparse matrices and expander graphs, with application to compressed sensing Ieee Transactions On Information Theory. 59: 7491-7508. DOI: 10.1109/TIT.2013.2274267  1
2013 Blanchard JD, Tanner J. GPU accelerated greedy algorithms for compressed sensing Mathematical Programming Computation. 5: 267-304. DOI: 10.1007/s12532-013-0056-5  1
2012 Powell AM, Tanner J, Wang Y, Yilmaz O. Coarse quantization for random interleaved sampling of bandlimited signals Esaim: Mathematical Modelling and Numerical Analysis. 46: 605-618. DOI: 10.1051/m2an/2011057  1
2010 Donoho DL, Tanner J. Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling Ieee Transactions On Information Theory. 56: 2002-2016. DOI: 10.1109/TIT.2010.2040892  1
2010 Chartrand R, Baraniuk RG, Eldar YC, Figueiredo MAT, Tanner J. Introduction to the issue on compressive sensing Ieee Journal On Selected Topics in Signal Processing. 4: 241-243. DOI: 10.1109/JSTSP.2010.2043892  1
2010 Donoho DL, Tanner J. Precise undersampling theorems Proceedings of the Ieee. 98: 913-924. DOI: 10.1109/JPROC.2010.2045630  1
2010 Donoho DL, Tanner J. Counting the faces of randomly-projected hypercubes and orthants, with applications Discrete and Computational Geometry. 43: 522-541. DOI: 10.1007/s00454-009-9221-z  1
2009 Donoho DL, Tanner J. Counting faces of randomly projected polytopes when the projection radically lowers dimension Journal of the American Mathematical Society. 22: 1-53. DOI: 10.1090/S0894-0347-08-00600-0  1
2007 Strohmer T, Tanner J. Fast reconstruction algorithms for periodic nonuniform sampling with applications to time-interleaved ADCs Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 3. DOI: 10.1109/ICASSP.2007.366821  1
2007 Donoho DL, Tanner J. Thresholds for the recovery of sparse solutions via L1 minimization 2006 Ieee Conference On Information Sciences and Systems, Ciss 2006 - Proceedings. 202-206. DOI: 10.1109/CISS.2006.286462  1
2006 Strohmer T, Tanner J. Fast reconstruction methods for bandlimited functions from periodic nonuniform sampling Siam Journal On Numerical Analysis. 44: 1073-1094. DOI: 10.1137/040609586  1
2006 Gelb A, Tanner J. Robust reprojection methods for the resolution of the Gibbs phenomenon Applied and Computational Harmonic Analysis. 20: 3-25. DOI: 10.1016/j.acha.2004.12.007  1
2005 Donoho DL, Tanner J. Sparse nonnegative solution of underdetermined linear equations by linear programming. Proceedings of the National Academy of Sciences of the United States of America. 102: 9446-51. PMID 15976026 DOI: 10.1073/pnas.0502269102  1
2005 Donoho DL, Tanner J. Neighborliness of randomly projected simplices in high dimensions. Proceedings of the National Academy of Sciences of the United States of America. 102: 9452-7. PMID 15972808 DOI: 10.1073/pnas.0502258102  1
2005 Tadmor E, Tanner J. Adaptive filters for piecewise smooth spectral data Ima Journal of Numerical Analysis. 25: 635-647. DOI: 10.1093/imanum/dri026  1
2002 Tadmor E, Tanner J. Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from Its Spectral Information Foundations of Computational Mathematics. 2: 155-189.  1
Show low-probability matches.