| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Santosh Vempala Amit Deshpande , Luis Rademacher , Santosh Vempala, Grant Wang : Matrix approximation and projective clustering via volume sampling. SODA 2006 : 1117-1126 Sanjeev Arora , László Lovász , Ilan Newman , Yuval Rabani , Yuri Rabinovich , Santosh Vempala: Local versus global properties of metric spaces. SODA 2006 : 41-50 László Lovász , Santosh Vempala: Hit-and-Run from a Corner. SIAM J. Comput. 35 (4): 985-1005 (2006) Ravindran Kannan , Hadi Salmasian , Santosh Vempala: The Spectral Method for General Mixture Models. COLT 2005 : 444-457 Imre Bárány , Santosh Vempala, Adrian Vetta : Nash Equilibria in Random Games. FOCS 2005 : 123-131 David Cheng , Santosh Vempala, Ravi Kannan , Grant Wang : A divide-and-merge methodology for clustering. PODS 2005 : 196-205 Wenceslas Fernandez de la Vega , Marek Karpinski , Ravi Kannan , Santosh Vempala: Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC 2005 : 747-754 Maria-Florina Balcan , Avrim Blum , Santosh Vempala: On Kernels, Margins, and Low-Dimensional Mappings. ALT 2004 : 194-205 Luis Rademacher , Santosh Vempala: Testing Geometric Convexity. FSTTCS 2004 : 469-480 László Lovász , Santosh Vempala: Hit-and-run from a corner. STOC 2004 : 310-314 John Dunagan , Santosh Vempala: A simple polynomial-time rescaling algorithm for solving linear programs. STOC 2004 : 315-320 Hadi Salmasian , Ravindran Kannan , Santosh Vempala: The Spectral Method for Mixture Models Electronic Colloquium on Computational Complexity (ECCC) (067): (2004) Ravi Kannan , Santosh Vempala, Adrian Vetta : On clusterings: Good, bad and spectral. J. ACM 51 (3): 497-515 (2004) Dimitris Bertsimas , Santosh Vempala: Solving convex programs by random walks. J. ACM 51 (4): 540-556 (2004) Alan M. Frieze , Ravi Kannan , Santosh Vempala: Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51 (6): 1025-1041 (2004) John Dunagan , Santosh Vempala: Optimal outlier removal in high-dimensional spaces. J. Comput. Syst. Sci. 68 (2): 335-373 (2004) Santosh Vempala, Grant Wang : A spectral algorithm for learning mixture models. J. Comput. Syst. Sci. 68 (4): 841-860 (2004) Petros Drineas , Alan M. Frieze , Ravi Kannan , Santosh Vempala, V. Vinay : Clustering Large Graphs via the Singular Value Decomposition. Machine Learning 56 (1-3): 9-33 (2004) Robert Carr , Santosh Vempala: On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. Math. Program. 100 (3): 569-587 (2004) Claudson F. Bornstein , Santosh Vempala: Flow metrics. Theor. Comput. Sci. 321 (1): 13-24 (2004) Adam Kalai , Santosh Vempala: Efficient Algorithms for Online Decision Problems. COLT 2003 : 26-40 László Lovász , Santosh Vempala: Logconcave Functions: Geometry and Efficient Sampling Algorithms FOCS 2003 : 640-649 László Lovász , Santosh Vempala: Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. FOCS 2003 : 650- Joseph Cheriyan , Santosh Vempala, Adrian Vetta : An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. SIAM J. Comput. 32 (4): 1050-1055 (2003) Santosh Vempala, Grant Wang : A Spectral Algorithm for Learning Mixtures of Distributions. FOCS 2002 : 113- Claudson F. Bornstein , Santosh Vempala: Flow Metrics. LATIN 2002 : 516-527 Dimitris Bertsimas , Santosh Vempala: Solving convex programs by random walks. STOC 2002 : 109-115 Joseph Cheriyan , Santosh Vempala, Adrian Vetta : Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002 : 306-312 Adam Kalai , Santosh Vempala: Efficient Algorithms for Universal Portfolios. Journal of Machine Learning Research 3 : 423-440 (2002) Robert D. Carr , Santosh Vempala: Randomized metarounding. Random Struct. Algorithms 20 (3): 343-352 (2002) Joseph Cheriyan , Santosh Vempala: Edge Covers of Setpairs and the Iterative Rounding Method. IPCO 2001 : 30-44 Alantha Newman , Santosh Vempala: Fences Are Futile: On Relaxations for the Linear Ordering Problem. IPCO 2001 : 333-347 John Dunagan , Santosh Vempala: On Euclidean Embeddings and Bandwidth Minimization. RANDOM-APPROX 2001 : 229-240 John Dunagan , Santosh Vempala: Optimal outlier removal in high-dimensional. STOC 2001 : 627-636 Prasad Tetali , Santosh Vempala: Random Sampling of Euler Tours. Algorithmica 30 (3): 376-385 (2001) Santosh Vempala, Adrian Vetta : Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000 : 262-273 Ravi Kannan , Santosh Vempala, Adrian Vetta : On Clusterings - Good, Bad and Spectral. FOCS 2000 : 367-377 Adam Kalai , Santosh Vempala: Efficient Algorithms for Universal Portfolios. FOCS 2000 : 486-491 Robert D. Carr , Santosh Vempala, Jacques Mandler : Towards a 4/3 approximation for the asymmetric traveling salesman problem. SODA 2000 : 116-125 Christos H. Papadimitriou , Santosh Vempala: On the approximability of the traveling salesman problem (extended abstract). STOC 2000 : 126-133 Robert D. Carr , Santosh Vempala: Randomized metarounding (extended abstract). STOC 2000 : 58-62 Christos H. Papadimitriou , Prabhakar Raghavan , Hisao Tamaki , Santosh Vempala: Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. 61 (2): 217-235 (2000) Avrim Blum , Goran Konjevod , R. Ravi , Santosh Vempala: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci. 235 (1): 25-42 (2000) Rosa I. Arriaga , Santosh Vempala: An Algorithmic Theory of Learning: Robust Concepts and Random Projection. FOCS 1999 : 616-623 Santosh Vempala, Berthold Vöcking : Approximating Multicast Congestion. ISAAC 1999 : 367-372 Petros Drineas , Alan M. Frieze , Ravi Kannan , Santosh Vempala, V. Vinay : Clustering in Large Graphs and Matrices. SODA 1999 : 291-299 Santosh Vempala, Mihalis Yannakakis : A Convex Relaxation for the Asymmetric TSP. SODA 1999 : 975-976 Avrim Blum , R. Ravi , Santosh Vempala: A Constant-Factor Approximation Algorithm for the k -MST Problem. J. Comput. Syst. Sci. 58 (1): 101-108 (1999) Ravi Kannan , Prasad Tetali , Santosh Vempala: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14 (4): 293-308 (1999) Alan M. Frieze , Ravi Kannan , Santosh Vempala: Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS 1998 : 370-378 Santosh Vempala: Random Projection: A New Approach to VLSI Layout. FOCS 1998 : 389-395 Christos H. Papadimitriou , Prabhakar Raghavan , Hisao Tamaki , Santosh Vempala: Latent Semantic Indexing: A Probabilistic Analysis. PODS 1998 : 159-168 Avrim Blum , Goran Konjevod , R. Ravi , Santosh Vempala: Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. STOC 1998 : 100-105 Avrim Blum , Alan M. Frieze , Ravi Kannan , Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22 (1/2): 35-52 (1998) Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. SIAM J. Comput. 28 (1): 254-262 (1998) Joseph S. B. Mitchell , Avrim Blum , Prasad Chalasani , Santosh Vempala: A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. SIAM J. Comput. 28 (3): 771-781 (1998) Santosh Vempala: A Random Sampling Based Algorithm for Learning the Intersection of Half-spaces. FOCS 1997 : 508-513 Prasad Tetali , Santosh Vempala: Random Sampling of Euler Tours. RANDOM 1997 : 57-66 Ravi Kannan , Prasad Tetali , Santosh Vempala: Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA 1997 : 193-200 Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan , Santosh Vempala: Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997 : 618-625 Ravi Kannan , Santosh Vempala: Sampling Lattice Points. STOC 1997 : 696-700 Andrew Kotlov , László Lovász , Santosh Vempala: The Colin de Verdière Number and Sphere Representations of a Graph. Combinatorica 17 (4): 483-521 (1997) Avrim Blum , Alan M. Frieze , Ravi Kannan , Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS 1996 : 330-338 Avrim Blum , R. Ravi , Santosh Vempala: A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). STOC 1996 : 442-448 Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala: Improved approximation guarantees for minimum-weight k -trees and prize-collecting salesmen. STOC 1995 : 277-283 Avrim Blum , Prasad Chalasani , Santosh Vempala: A constant-factor approximation for the k -MST problem in the plane. STOC 1995 : 294-302 Vivek Arora , Santosh Vempala, Huzur Saran , Vijay V. Vazirani : A Limited-Backtrack Greedy Schema for Approximation Algorithms. FSTTCS 1994 : 318-329 Naveen Garg , Santosh Vempala, Aman Singla : Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. SODA 1993 : 103-111 1 [ 67 ] 2 [ 2 ] 3 [ 25 ] 4 [ 4 ] [ 14 ] 5 [ 4 ] [ 14 ] 6 [ 61 ] 7 [ 64 ] 8 [ 42 ] [ 55 ] 9 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 21 ] [ 26 ] [ 61 ] 10 [ 43 ] [ 49 ] 11 [ 50 ] 12 [ 28 ] [ 30 ] [ 39 ] 13 [ 3 ] [ 13 ] 14 [ 63 ] 15 [ 38 ] [ 41 ] [ 45 ] 16 [ 68 ] 17 [ 23 ] [ 51 ] 18 [ 35 ] [ 36 ] [ 53 ] [ 58 ] 19 [ 6 ] [ 15 ] [ 19 ] [ 23 ] [ 51 ] [ 54 ] 20 [ 1 ] 21 [ 9 ] 22 [ 31 ] [ 40 ] [ 48 ] 23 [ 6 ] [ 8 ] [ 10 ] [ 15 ] [ 19 ] [ 20 ] [ 23 ] [ 32 ] [ 51 ] [ 54 ] [ 56 ] [ 57 ] [ 62 ] [ 63 ] [ 65 ] 24 [ 62 ] 25 [ 16 ] [ 26 ] 26 [ 7 ] 27 [ 7 ] [ 46 ] [ 47 ] [ 59 ] [ 66 ] [ 67 ] 28 [ 30 ] 29 [ 13 ] 30 [ 9 ] 31 [ 37 ] 32 [ 67 ] 33 [ 17 ] [ 27 ] [ 29 ] 34 [ 67 ] 35 [ 67 ] 36 [ 60 ] [ 68 ] 37 [ 9 ] [ 17 ] [ 27 ] 38 [ 5 ] [ 16 ] [ 21 ] [ 26 ] 39 [ 57 ] [ 65 ] 40 [ 2 ] 41 [ 1 ] 42 [ 17 ] [ 27 ] 43 [ 10 ] [ 11 ] [ 20 ] [ 34 ] 44 [ 2 ] 45 [ 62 ] 46 [ 32 ] [ 33 ] [ 41 ] [ 45 ] [ 56 ] [ 64 ] 47 [ 23 ] [ 51 ] 48 [ 24 ] 49 [ 44 ] [ 52 ] [ 63 ] [ 68 ] 50 [ 22 ]  ©2006 Association for Computing Machinery |
