| 2007 |
|---|
| 10 | EE | Amit Deshpande,
Kasturi R. Varadarajan:
Sampling-based dimension reduction for subspace approximation.
STOC 2007: 641-650 |
| 2006 |
|---|
| 9 | EE | Amit Deshpande,
Santosh Vempala:
Adaptive Sampling and Fast Low-Rank Matrix Approximation.
APPROX-RANDOM 2006: 292-303 |
| 8 | EE | Amit Deshpande,
Luis Rademacher,
Santosh Vempala,
Grant Wang:
Matrix approximation and projective clustering via volume sampling.
SODA 2006: 1117-1126 |
| 7 | EE | Amit Deshpande,
Luis Rademacher,
Santosh Vempala,
Grant Wang:
Matrix Approximation and Projective Clustering via Volume Sampling.
Theory of Computing 2(1): 225-247 (2006) |
| 2005 |
|---|
| 6 | EE | Amit Deshpande,
Daniel A. Spielman:
Improved Smoothed Analysis of the Shadow Vertex Simplex Method.
FOCS 2005: 349-356 |
| 5 | | Rosina Weber,
Ilya Waldstein,
Amit Deshpande,
Jason M. Proctor:
Integrated Approach to Detect Inconspicuous Content.
Wissensmanagement 2005: 281-286 |
| 4 | EE | Rosina Weber,
Ilya Waldstein,
Amit Deshpande,
Jason M. Proctor:
Integrated Approach to Detect Inconspicuous Contents.
Wissensmanagement (LNCS Volume) 2005: 304-315 |
| 3 | EE | Amit Deshpande,
Rahul Jain,
Telikepalli Kavitha,
Satyanarayana V. Lokam,
Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes.
Random Struct. Algorithms 27(3): 358-378 (2005) |
| 2003 |
|---|
| 2 | | S. A. M. Makki,
Niki Pissinou,
Tirthankar Ghosh,
Amit Deshpande:
Study of Network Performance in a Simulated Network for Optimized Node Degree and Network Cost.
International Conference on Internet Computing 2003: 747-752 |
| 2002 |
|---|
| 1 | EE | Amit Deshpande,
Rahul Jain,
Telikepalli Kavitha,
Jaikumar Radhakrishnan,
Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes.
IEEE Conference on Computational Complexity 2002: 184-193 |
