Amit Deshpande
Amit Deshpande
Microsoft Research
Verified email at microsoft.com
Title
Cited by
Cited by
Year
NP-hardness of Euclidean sum-of-squares clustering
D Aloise, A Deshpande, P Hansen, P Popat
Machine learning 75 (2), 245-248, 2009
9792009
Matrix approximation and projective clustering via volume sampling
A Deshpande, L Rademacher, S Vempala, G Wang
Theory of Computing 2 (1), 225-247, 2006
3302006
Adaptive sampling and fast low-rank matrix approximation
A Deshpande, S Vempala
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
2152006
Efficient volume sampling for row/column subset selection
A Deshpande, L Rademacher
2010 ieee 51st annual symposium on foundations of computer science, 329-338, 2010
1822010
Adaptive Sampling for k-Means Clustering
A Aggarwal, A Deshpande, R Kannan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
1182009
Batched gaussian process bandit optimization via determinantal point processes
T Kathuria, A Deshpande, P Kohli
arXiv preprint arXiv:1611.04088, 2016
642016
Fair and diverse DPP-based data summarization
E Celis, V Keswani, D Straszak, A Deshpande, T Kathuria, N Vishnoi
International Conference on Machine Learning, 716-725, 2018
602018
How to be fair and diverse?
LE Celis, A Deshpande, T Kathuria, NK Vishnoi
arXiv preprint arXiv:1610.07183, 2016
492016
Sampling-based dimension reduction for subspace approximation
A Deshpande, K Varadarajan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
492007
Better lower bounds for locally decodable codes
A Deshpande, R Jain, T Kavitha, SV Lokam, J Radhakrishnan
Proceedings 17th IEEE Annual Conference on Computational Complexity, 184-193, 2002
482002
On greedy maximization of entropy
D Sharma, A Kapoor, A Deshpande
International Conference on Machine Learning, 1330-1338, 2015
432015
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
392011
Improved smoothed analysis of the shadow vertex simplex method
A Deshpande, DA Spielman
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 349-356, 2005
262005
On the complexity of constrained determinantal point processes
LE Celis, A Deshpande, T Kathuria, D Straszak, NK Vishnoi
arXiv preprint arXiv:1608.00554, 2016
182016
Partitioning a planar graph of girth ten into a forest and a matching
A Bassa, J Burns, J Campbell, A Deshpande, J Farley, M Halsey, ...
manuscript, 2004
142004
On sampling and greedy map inference of constrained determinantal point processes
T Kathuria, A Deshpande
arXiv preprint arXiv:1607.01551, 2016
122016
Sampling s-concave functions: The limit of convexity based isoperimetry
K Chandrasekaran, A Deshpande, S Vempala
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
122009
Sampling-based algorithms for dimension reduction
AJ Deshpande
Massachusetts Institute of Technology, 2007
102007
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
A Bassa, J Burns, J Campbell, A Deshpande, J Farley, M Halsey, SY Ho, ...
Studies in Applied Mathematics 124 (3), 213-228, 2010
82010
Blood count on a smartphone microscope: Challenges
UP Moravapalle, A Deshpande, A Kapoor, R Ramjee, P Ravi
Proceedings of the 18th International Workshop on Mobile Computing Systems …, 2017
72017
The system can't perform the operation now. Try again later.
Articles 1–20