Santosh S. Vempala
TitleCited byYear
On clusterings: Good, bad and spectral
R Kannan, S Vempala, A Vetta
Journal of the ACM (JACM) 51 (3), 497-515, 2004
13482004
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou, P Raghavan, H Tamaki, S Vempala
Journal of Computer and System Sciences 61 (2), 217-235, 2000
12502000
Fast Monte-Carlo algorithms for finding low-rank approximations
A Frieze, R Kannan, S Vempala
Journal of the ACM (JACM) 51 (6), 1025-1041, 2004
6952004
Clustering large graphs via the singular value decomposition
P Drineas, A Frieze, R Kannan, S Vempala, V Vinay
Machine learning 56 (1-3), 9-33, 2004
5152004
Clustering large graphs via the singular value decomposition
P Drineas, A Frieze, R Kannan, S Vempala, V Vinay
Machine learning 56 (1-3), 9-33, 2004
5152004
Efficient algorithms for online decision problems
A Kalai, S Vempala
Journal of Computer and System Sciences 71 (3), 291-307, 2005
4782005
The random projection method
SS Vempala
American Mathematical Soc., 2005
4162005
Filtering spam with behavioral blacklisting
A Ramachandran, N Feamster, S Vempala
Proceedings of the 14th ACM conference on Computer and communications …, 2007
3172007
Matrix approximation and projective clustering via volume sampling
A Deshpande, L Rademacher, S Vempala, G Wang
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
2862006
Simulated annealing in convex bodies and an O*(n4) volume algorithm
L Lovász, S Vempala
Journal of Computer and System Sciences 72 (2), 392-417, 2006
2502006
The geometry of logconcave functions and sampling algorithms
L Lovász, S Vempala
Random Structures & Algorithms 30 (3), 307-358, 2007
2452007
Clustering in Large Graphs and Matrices.
P Drineas, AM Frieze, R Kannan, S Vempala, V Vinay
SODA 99, 291-299, 1999
2431999
Path splicing
M Motiwala, M Elmore, N Feamster, S Vempala
ACM SIGCOMM Computer Communication Review 38 (4), 27-38, 2008
2382008
An algorithmic theory of learning: Robust concepts and random projection
RI Arriaga, S Vempala
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
2371999
A divide-and-merge methodology for clustering
D Cheng, R Kannan, S Vempala, S Vempala, S Vempala, G Wang
ACM Transactions on Database Systems (TODS) 31 (4), 1499-1525, 2006
235*2006
New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
B Awerbuch, Y Azar, A Blum, S Vempala
SIAM Journal on computing 28 (1), 254-262, 1998
2351998
The geometry of logconcave functions and sampling algorithms
L Lovász, S Vempala
Random Structures & Algorithms 30 (3), 307-358, 2007
2272007
Locality-preserving hashing in multidimensional spaces
P Indyk, R Motwani, P Raghavan, S Vempala
STOC 97, 618-625, 1997
2121997
Solving convex programs by random walks
D Bertsimas, S Vempala, S Vempala, S Vempala
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
2072002
Hit-and-run from a corner
L Lovász, S Vempala
SIAM Journal on Computing 35 (4), 985-1005, 2006
2032006
The system can't perform the operation now. Try again later.
Articles 1–20