- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i15 |      | Dennis Amelunxen, Martin Lotz, Michael B. McCoy, Joel A. Tropp: Living on the edge: A geometric theory of phase transitions in convex optimization. CoRR abs/1303.6672 (2013) |
| 2012 | ||
| j18 | | Joel A. Tropp: User-Friendly Tail Bounds for Sums of Random Matrices. Foundations of Computational Mathematics 12(4): 389-434 (2012) |
| c7 | | Ben Recht, Christopher Re, Joel A. Tropp, Victor Bittorf: Factoring nonnegative matrices with linear programs. NIPS 2012: 1223-1231 |
| i14 | | Gilad Lerman, Michael B. McCoy, Joel A. Tropp, Teng Zhang: Robust computation of linear models, or How to find a needle in a haystack. CoRR abs/1202.4044 (2012) |
| i13 | | Michael B. McCoy, Joel A. Tropp: Sharp recovery bounds for convex deconvolution, with applications. CoRR abs/1205.1580 (2012) |
| i12 | | Victor Bittorf, Benjamin Recht, Christopher Re, Joel A. Tropp: Factoring nonnegative matrices with linear programs. CoRR abs/1206.1270 (2012) |
| i11 | | Deanna Needell, Joel A. Tropp: Paved with Good Intentions: Analysis of a Randomized Block Kaczmarz Method. CoRR abs/1208.3805 (2012) |
| 2011 | ||
| j17 | | Joel A. Tropp: Improved Analysis of the subsampled Randomized Hadamard Transform. Advances in Adaptive Data Analysis 3(1-2): 115-126 (2011) |
| j16 | | Nathan Halko, Per-Gunnar Martinsson, Joel A. Tropp: Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions. SIAM Review 53(2): 217-288 (2011) |
| i10 | | Joel A. Tropp: From joint convexity of quantum relative entropy to a concavity theorem of Lieb. CoRR abs/1101.1070 (2011) |
| i9 | | Götz E. Pfander, Holger Rauhut, Joel A. Tropp: The restricted isometry property for time-frequency structured random matrices. CoRR abs/1106.3184 (2011) |
| 2010 | ||
| j15 | | Deanna Needell, Joel A. Tropp: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Commun. ACM 53(12): 93-100 (2010) |
| j14 | | Joel A. Tropp, Stephen J. Wright: Computational Methods for Sparse Solution of Linear Inverse Problems. Proceedings of the IEEE 98(6): 948-958 (2010) |
| j13 | | Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Justin K. Romberg, Richard G. Baraniuk: Beyond Nyquist: efficient sampling of sparse bandlimited signals. IEEE Transactions on Information Theory 56(1): 520-544 (2010) |
| c6 | | |
| c5 | | Jason D. Lee, Ben Recht, Ruslan Salakhutdinov, Nathan Srebro, Joel A. Tropp: Practical Large-Scale Optimization for Max-norm Regularization. NIPS 2010: 1297-1305 |
| i8 | | Joel A. Tropp: The Sparsity Gap: Uncertainty Principles Proportional to Dimension. CoRR abs/1003.0415 (2010) |
| i7 | | Holger Rauhut, Justin K. Romberg, Joel A. Tropp: Restricted Isometries for Partial Random Circulant Matrices. CoRR abs/1010.1847 (2010) |
| i6 | | Joel A. Tropp: Improved analysis of the subsampled randomized Hadamard transform. CoRR abs/1011.1595 (2010) |
| 2009 | ||
| c4 | | Joel A. Tropp: Column subset selection, matrix factorization, and eigenvalue optimization. SODA 2009: 978-986 |
| i5 | | Moshe Mishali, Yonina C. Eldar, Joel A. Tropp: Efficient Sampling of Sparse Wideband Analog Signals. CoRR abs/0901.3950 (2009) |
| i4 | | Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Justin K. Romberg, Richard G. Baraniuk: Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals. CoRR abs/0902.0026 (2009) |
| 2008 | ||
| j12 | | Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer, Joel A. Tropp: Constructing Packings in Grassmannian Manifolds via Alternating Projection. Experimental Mathematics 17(1): 9-35 (2008) |
| j11 | | Justin Brickell, Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp: The Metric Nearness Problem. SIAM J. Matrix Analysis Applications 30(1): 375-396 (2008) |
| i3 | | Joel A. Tropp, Deanna Needell: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. CoRR abs/0803.2392 (2008) |
| i2 | | Deanna Needell, Joel A. Tropp, Roman Vershynin: Greedy Signal Recovery Review. CoRR abs/0812.2202 (2008) |
| 2007 | ||
| j10 | | Inderjit S. Dhillon, Joel A. Tropp: Matrix Nearness Problems with Bregman Divergences. SIAM J. Matrix Analysis Applications 29(4): 1120-1146 (2007) |
| j9 | | Joel A. Tropp, Anna C. Gilbert: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. IEEE Transactions on Information Theory 53(12): 4655-4666 (2007) |
| c3 | | Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin: One sketch for all: fast algorithms for compressed sensing. STOC 2007: 237-246 |
| 2006 | ||
| j8 | | Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss: Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal Processing 86(3): 572-588 (2006) |
| j7 | | Joel A. Tropp: Algorithms for simultaneous sparse approximation. Part II: Convex relaxation. Signal Processing 86(3): 589-602 (2006) |
| j6 | | Joel A. Tropp: Just relax: convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory 52(3): 1030-1051 (2006) |
| i1 | | Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin: Algorithmic linear dimension reduction in the l_1 norm for sparse vectors. CoRR abs/cs/0608079 (2006) |
| 2005 | ||
| j5 | | Inderjit S. Dhillon, Robert W. Heath Jr., Mátyás A. Sustik, Joel A. Tropp: Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum. SIAM J. Matrix Analysis Applications 27(1): 61-71 (2005) |
| j4 | | Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer: Designing structured tight frames via an alternating projection method. IEEE Transactions on Information Theory 51(1): 188-209 (2005) |
| j3 | | Joel A. Tropp: Recovery of short, complex linear combinations via /spl lscr//sub 1/ minimization. IEEE Transactions on Information Theory 51(4): 1568-1570 (2005) |
| 2004 | ||
| j2 | | Joel A. Tropp: Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory 50(10): 2231-2242 (2004) |
| j1 | | Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr.: Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences. IEEE Transactions on Information Theory 50(11): 2916-2921 (2004) |
| c2 | | Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp: Triangle Fixing Algorithms for the Metric Nearness Problem. NIPS 2004 |
| 2003 | ||
| c1 | | Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss: Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: 37-40 |
| 1 | Dennis Amelunxen | |
| 2 | Richard G. Baraniuk | |
| 3 | Victor Bittorf | |
| 4 | Justin Brickell | |
| 5 | Inderjit S. Dhillon | |
| 6 | Marco F. Duarte | |
| 7 | Yonina C. Eldar | |
| 8 | Anna C. Gilbert | |
| 9 | Nathan Halko | |
| 10 | Robert W. Heath Jr. (Robert W. Heath) | |
| 11 | Jason N. Laska | |
| 12 | Jason D. Lee | |
| 13 | Gilad Lerman | |
| 14 | Martin Lotz | |
| 15 | Per-Gunnar Martinsson | |
| 16 | Michael B. McCoy | |
| 17 | Moshe Mishali | |
| 18 | S. Muthukrishnan (S. Muthu Muthukrishnan) | |
| 19 | Deanna Needell | |
| 20 | Götz E. Pfander | |
| 21 | Holger Rauhut | |
| 22 | Benjamin Recht (Ben Recht) | |
| 23 | Justin K. Romberg | |
| 24 | Christopher Ré (Christopher Re) | |
| 25 | Ruslan Salakhutdinov | |
| 26 | Suvrit Sra | |
| 27 | Nathan Srebro (Nati Srebro) | |
| 28 | Martin Strauss (Martin J. Strauss) | |
| 29 | Thomas Strohmer | |
| 30 | Mátyás A. Sustik | |
| 31 | Roman Vershynin | |
| 32 | Stephen J. Wright | |
| 33 | Teng Zhang |
Colors in the list of coauthors
Last update Thu May 23 18:13:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page