- EFFICIENT SAMPLING OF SPARSE WIDEBAND ANALOG SIGNALS Moshe Mishali and Yonina C. Eldar
- SIMULTANEOUS SPARSE APPROXIMATION VIA GREEDY PURSUIT J. A. Tropp, A. C. Gilbert
- Complex Equiangular Tight Frames Joel A. Troppa
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 2, FEBRUARY 2009 917 Corrigendum in "Just Relax: Convex Programming
- 188 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 1, JANUARY 2005 Designing Structured Tight Frames Via an
- Computational Methods for Sparse Solution of Linear
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- On the existence of equiangular tight frames
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. MATRIX ANAL. APPL. c 2008 Society for Industrial and Applied Mathematics
- AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
- FROM JOINT CONVEXITY OF QUANTUM RELATIVE ENTROPY TO A CONCAVITY THEOREM OF LIEB
- 1030 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 3, MARCH 2006 Just Relax: Convex Programming Methods for
- GREEDY SIGNAL RECOVERY REVIEW DEANNA NEEDELL, JOEL A. TROPP, ROMAN VERSHYNIN
- IMPROVEDSPARSEAPPROXIMATIONOVER QUASI-INCOHEmNT DICTIONARIES J A. Ropp' A. C. Gilbed S. Mtrthiilcrishnnd M. J Str.auss
- Infinitesimals: History & Application
- Norms of random submatrices and sparse approximation Joel A. Tropp 1
- ISlT 2003,Yokohama,Japan,June 29-July 4,2003 Optimal CDMA Signature Sequences,
- THE CONE THEOREM JOEL A. TROPP
- Probab. Theory Relat. Fields DOI 10.1007/s00440-011-0360-9
- Elect. Comm. in Probab. 16 (2011), 262270 ELECTRONIC COMMUNICATIONS
- Average-Case Analysis of Greedy Pursuit Joel A. Troppa
- TAIL BOUNDS FOR ALL EIGENVALUES OF A SUM OF RANDOM MATRICES
- SPARSE APPROXIMATION VIA ITERATIVE THRESHOLDING Kyle K. Herrity, Anna C. Gilbert, and Joel A. Tropp
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- ON THE CONDITIONING OF RANDOM SUBDICTIONARIES JOEL A. TROPP
- ALGORITHMIC LINEAR DIMENSION REDUCTION IN THE 1 NORM FOR SPARSE VECTORS
- ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION PART II: CONVEX RELAXATION
- CDMA Signature Sequences with Low Peak-to-Average-Power Ratio
- Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp
- Metric Nearness: Problem Formulation and Algorithms
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 10, OCTOBER 2004 2231 Greed is Good: Algorithmic Results for
- COSAMP: ITERATIVE SIGNAL RECOVERY FROM INCOMPLETE AND INACCURATE SAMPLES
- 1568 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 4, APRIL 2005 Recovery of Short, Complex Linear Combinations
- arXiv:0911.4108v1[math.NA]20Nov2009 ERROR BOUNDS FOR RANDOM MATRIX APPROXIMATION SCHEMES
- CONSTRUCTING PACKINGS IN GRASSMANNIAN MANIFOLDS VIA ALTERNATING PROJECTION
- Random Filters for Compressive Sampling Joel A. Tropp
- GREED IS GOOD: ALGORITHMIC RESULTS FOR SPARSE APPROXIMATION
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 12, DECEMBER 2007 4655 Signal Recovery From Random Measurements
- JOEL A. TROPP curriculum vitae
- The Sparsity Gap: Uncertainty Principles Proportional to Dimension
- THE RANDOM PAVING PROPERTY FOR UNIFORMLY BOUNDED MATRICES
- 520 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY 2010 Beyond Nyquist: Efficient Sampling of Sparse
- DIGITAL VISION uppose that x is a discrete-time signal of length N that can be expressed with
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. MATRIX ANAL. APPL. c 2007 Society for Industrial and Applied Mathematics
- AN ALTERNATING MINIMIZATION ALGORITHM FOR NON-NEGATIVE MATRIX APPROXIMATION
- TWO PROPOSALS FOR ROBUST PCA USING SEMIDEFINITE PROGRAMMING
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- Doi:10.1145/1859204.1859229 dECEmBEr 2010 | vol. 53 | No. 12 | CommuniCaTionS of ThE aCm 93
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- 2916 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 11, NOVEMBER 2004 Finite-Step Algorithms for Constructing Optimal CDMA
- Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
- Applications of sparse approximation in communications
- Construction of Equiangular Signatures for Synchronous CDMA Systems
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- JUST RELAX: CONVEX PROGRAMMING METHODS
- Literature Survey: Non-Negative Matrix Factorization
- CNOIDAL SOLUTIONS TO THE pTH-ORDER KORTEWEG-DE VRIES EQUATION
- GALERKIN'S METHOD FOR NONLINEAR COMPACT FIXED-POINT PROBLEMS
- FLOW AROUND A SYMMETRIC OBSTACLE JOEL A. TROPP
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM REVIEW c 2011 Society for Industrial and Applied Mathematics
- ON THE LINEAR INDEPENDENCE OF SPIKES AND SINES JOEL A. TROPP
- Joel Aaron Tropp The Dissertation Committee for Joel Aaron Tropp
- THE MASKED SAMPLE COVARIANCE ESTIMATOR: AN ANALYSIS VIA THE MATRIX LAPLACE TRANSFORM
- TAIL BOUNDS FOR ALL EIGENVALUES OF A SUM OF RANDOM MATRICES
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Found Comput Math DOI 10.1007/s10208-011-9099-z
- Electronic Journal of Statistics Vol. 5 (2011) 11231160
- Information and Inference: A Journal of the IMA (2012) Page 1 of 19 doi:10.1093/imaiai/iarxxx
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- ROBUST COMPUTATION OF LINEAR MODELS, OR HOW TO FIND A NEEDLE IN A HAYSTACK
- MATRIX CONCENTRATION INEQUALITIES VIA THE METHOD OF EXCHANGEABLE PAIRS
