WorldCat Identities

Vempala, Santosh S. (Santosh Srinivas) 1971-

Overview
Works: 11 works in 30 publications in 1 language and 285 library holdings
Roles: Author, Editor
Publication Timeline
.
Most widely held works by Santosh S Vempala
The random projection method by Santosh S Vempala( Book )

11 editions published between 2004 and 2008 in English and held by 207 WorldCat member libraries worldwide

"Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups."--BOOK JACKET
Spectral algorithms by Ravi Kannan( )

7 editions published between 2008 and 2009 in English and held by 64 WorldCat member libraries worldwide

Spectral methods refer to the use of eigenvalues, eigenvectors, singular values, and singular vectors. They are widely used in Engineering, Applied Mathematics, and Statistics. More recently, spectral methods have found numerous applications in Computer Science to "discrete" as well as "continuous" problems. This monograph describes modern applications of spectral methods and novel algorithms for estimating spectral parameters. In the first part of the monograph, we present applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning, and clustering. The second part of the monograph is motivated by efficiency considerations. A feature of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on "sampling on the fly" from massive matrices. Good estimates of singular values and low-rank approximations of the whole matrix can be provably derived from a sample. Our main emphasis in the second part of the monograph is to present these sampling methods with rigorous error bounds. We also present recent extensions of spectral methods from matrices to tensors and their applications to some combinatorial optimization problems
Geometric tools for algorithms by Santosh S Vempala( Book )

4 editions published in 1997 in English and held by 6 WorldCat member libraries worldwide

Abstract: "Our thesis is that a geometric perspective yields insights into the structure of fundamental problems, and thereby suggests efficient algorithms for them. As evidence, we develop new geometric models and general-purpose tools for removing outliers from numeric data, reducing dimensionality, and counting combinatorial sets. Then we apply these techniques to a set of old problems to obtain polynomial-time algorithms. These include: (1) learning noisy linear-threshold functions (half-spaces), (2) learning the intersection of half-spaces, (3) clustering text corpora, and (4) counting lattice points in a convex body. We supplement some of our theorems with experimental studies."
Simple Markov chain algorithms for generating bipartite graphs and tournaments by Ravi Kannan( )

1 edition published in 1997 in English and held by 1 WorldCat member library worldwide

Towards a 4/3 approximation for the asymmetric traveling salesman problem by Robert Carr( )

1 edition published in 2000 in English and held by 1 WorldCat member library worldwide

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)( )

1 edition published in 2017 in English and held by 1 WorldCat member library worldwide

An efficient re-scaled perceptron algorithm for conic systems( )

1 edition published in 2006 in English and held by 1 WorldCat member library worldwide

Latent semantic indexing : a probabilistic analysis by Christos H Papadimitriou( Book )

1 edition published in 1998 in English and held by 1 WorldCat member library worldwide

Abstract: "Latent semantic indexing (LSI) is an information retrieval technique based on the spectral analysis of the term-document matrix, whose empirical success had heretofore been without rigorous prediction and explanation. We prove that, under certain conditions, LSI does succeed in capturing the underlying semantics of the corpus and achieves improved retrieval performance. We also propose the technique of random projection as a way of speeding up LSI. We complement our theorems with encouraging experimental results. We also argue that our results may be viewed in a more general framework, as a theoretical basis for the use of spectral methods in a wider class of applications such as collaborative filtering."
The random projection method by Santosh S Vempala( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen by B Awerbuch( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Our result improves on the previous best bound of O([square root of k]) of Ravi et al. and comes quite close to the bound of O(log k) of Garg and Hochbaum for the special case of points in 2-dimensional Euclidean space."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.68 (from 0.64 for Spectral a ... to 0.99 for Simple Mar ...)

The random projection method
Covers
Spectral algorithmsThe random projection method
Alternative Names
Santosh Vempala computer scientist

Vempala, S. S.

Vempala, Santosh.

Vempala, Santosh Srinivas

Vempala, Santosh Srinivas 1971-

సంతోష్ వెంపల

Languages
English (30)