 | 
| |
Online DBLP entries are available for Santosh Vempala and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Christos
H. Papadimitriou,
Prabhakar
Raghavan,
Hisao
Tamaki, Santosh Vempala: Latent Semantic Indexing: A Probabilistic
Analysis.
PODS
1998: 159-168
-
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: 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
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
