Jared Tanner - Citegraph

Author Info

Name	Affiliation	Papers
JARED TANNER	Univ Edinburgh, Sch Math, Edinburgh, Midlothian, Scotland	29
Collaborators	Citations	PageRank
29	525	42.48
Referers	Referees	References
880	287	284

Search Limit

100880

Publications (29 rows)

Collaborators (29 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset	0	0.34	2021
Trajectory growth lower bounds for random sparse deep ReLU networks.	0	0.34	2021
An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI	1	0.36	2020
Multispectral Snapshot Demosaicing Via Non-Convex Matrix Completion	0	0.34	2019
Sparse Non-Negative Super-Resolution - Simplified And Stabilised	2	0.36	2018
A robust parallel algorithm for combinatorial compressed sensing.	0	0.34	2018
On the construction of sparse matrices from expander graphs.	0	0.34	2018
Matrix Rigidity And The Ill-Posedness Of Robust Pca And Matrix Completion	0	0.34	2018
Performance comparisons of greedy algorithms in compressed sensing.	15	0.66	2015
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing	11	0.60	2015
Expander ℓ0-Decoding.	0	0.34	2015
Normalized Iterative Hard Thresholding for Matrix Completion.	33	0.94	2013
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing	15	0.72	2013
GPU accelerated greedy algorithms for compressed sensing.	16	1.04	2013
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing.	0	0.34	2013
Matrix completion algorithms with optimal phase transition	0	0.34	2013
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices	4	0.39	2012
Compressed Sensing: How Sharp Is the Restricted Isometry Property?	60	2.83	2011
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices	35	1.94	2010
Phase Transitions for Greedy Sparse Approximation Algorithms	29	1.73	2010
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling	24	2.72	2010
Introduction to the Issue on Compressive Sensing	1	0.74	2010
Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing.	114	6.96	2009
Decay Properties of Restricted Isometry Constants	9	0.90	2009
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications	67	6.26	2008
Identification of Matrices Having a Sparse Representation	32	4.20	2008
Optimal filter and mollifier for piecewise smooth spectral data	15	1.15	2006
Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling	15	1.13	2006
Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information	27	3.81	2002