☰

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/
Tree Info Grants Similar researchers PubMed Report error

31 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
2020 Stolz BJ, Tanner J, Harrington HA, Nanda V. Geometric anomaly detection in data. Proceedings of the National Academy of Sciences of the United States of America. PMID 32747569 DOI: 10.1073/Pnas.2001741117  0.311
2018 Bah B, Tanner J. On the Construction of Sparse Matrices From Expander Graphs Frontiers in Applied Mathematics and Statistics. 4. DOI: 10.3389/Fams.2018.00039  0.358
2018 Mendoza-Smith R, Tanner J. Expander ℓ 0 -decoding Applied and Computational Harmonic Analysis. 45: 642-667. DOI: 10.1016/J.Acha.2017.03.001  0.341
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  0.351
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  0.312
2015 Blanchard JD, Tanner J, Wei K. CGIHT: Conjugate Gradient Iterative Hard Thresholding for Compressed Sensing and Matrix Completion Information and Inference: a Journal of the Ima. 4: 289-327. DOI: 10.1093/Imaiai/Iav011  0.359
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  0.328
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  0.391
2013 Tanner J, Wei K. Normalized iterative hard thresholding for matrix completion Siam Journal On Scientific Computing. 35: S104-S125. DOI: 10.1137/120876459  0.345
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  0.302
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  0.319
2012 Calderbank R, Donoho DL, Shawe-Taylor J, Tanner J. Dear Information and Inference Reader Information and Inference: a Journal of the Ima. 1: 1-1. DOI: 10.1093/Imaiai/Ias004  0.477
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  0.312
2011 Blanchard JD, Cartis C, Tanner J. Compressed Sensing: How Sharp Is the Restricted Isometry Property? Siam Review. 53: 105-125. DOI: 10.1137/090748160  0.372
2011 Blanchard JD, Cartis C, Tanner J, Thompson A. Phase transitions for greedy sparse approximation algorithms Applied and Computational Harmonic Analysis. 30: 188-203. DOI: 10.1016/J.Acha.2010.07.001  0.35
2010 Bah B, Tanner J. Improved Bounds on Restricted Isometry Constants for Gaussian Matrices Siam Journal On Matrix Analysis and Applications. 31: 2882-2898. DOI: 10.1137/100788884  0.397
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  0.585
2010 Donoho DL, Tanner J. Precise undersampling theorems Proceedings of the Ieee. 98: 913-924. DOI: 10.1109/JPROC.2010.2045630  0.549
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  0.587
2009 Donoho D, Tanner J. Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. Philosophical Transactions. Series a, Mathematical, Physical, and Engineering Sciences. 367: 4273-93. PMID 19805445 DOI: 10.1098/Rsta.2009.0152  0.554
2009 Blanchard J, Cartis C, Tanner J. Decay Properties of Restricted Isometry Constants Ieee Signal Processing Letters. 16: 572-575. DOI: 10.1109/Lsp.2009.2020882  0.359
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  0.454
2008 Pfander G, Rauhut H, Tanner J. Identification of Matrices Having a Sparse Representation Ieee Transactions On Signal Processing. 56: 5376-5388. DOI: 10.1109/Tsp.2008.928503  0.301
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  0.497
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  0.316
2006 Tanner J. Optimal filter and mollifier for piecewise smooth spectral data Mathematics of Computation. 75: 767-791. DOI: 10.1090/S0025-5718-06-01822-9  0.312
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  0.324
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  0.547
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  0.542
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  0.526
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. DOI: 10.1007/S102080010019  0.539
Show low-probability matches.