en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Vempala
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(169)
tags
dblp
imported
clustering
lsa
monte_carlo_algorithm
online-learning
low_rank_approximation
singular_value_decomposition
graph_theory
graph
Kannan
lsi
vldb
community
portfolio
svd
vis,
min-cut
spectral
Clustering
SVD
TO-READ
SS10_HPI
robust_statistics
probabilistic
graph,
SingularValueDecomposition
differential_privacy
evaluation
00
database_privacy
outlier
No matching items.
Efficient Algorithms for Online Decision Problems
Adam Kalai
, and
Santosh Vempala
.
COLT,
volume 2777 of Lecture Notes in Computer Science,
page 26-40.
Springer,
(
2003
)
Adam Kalai
, and
Santosh Vempala
.
COLT,
volume 2777 of Lecture Notes in Computer Science,
page 26-40.
Springer,
(
2003
)
11 days ago
by
wkotl
3
online-learning
online-learning
URL
DOI
TeX
Efficient Algorithms for Universal Portfolios.
Adam Kalai
, and
Santosh Vempala
.
FOCS,
page 486-491.
IEEE Computer Society,
(
2000
)
Adam Kalai
, and
Santosh Vempala
.
FOCS,
page 486-491.
IEEE Computer Society,
(
2000
)
11 days ago
by
wkotl
2
TO-READ
online-learning
portfolio
TO-READ
online-learning
portfolio
URL
DOI
TeX
The Approximate Rank of a Matrix and its Algorithmic Applications.
Noga Alon
, and
Santosh Vempala
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
Noga Alon
, and
Santosh Vempala
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
4 months and 6 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Statistical Algorithms and a Lower Bound for Planted Clique.
Vitaly Feldman
,
Elena Grigorescu
,
Lev Reyzin
,
Santosh Vempala
, and
Ying Xiao
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
Vitaly Feldman
,
Elena Grigorescu
,
Lev Reyzin
,
Santosh Vempala
, and
Ying Xiao
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
4 months and 6 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Randomly-oriented k-d Trees Adapt to Intrinsic Dimension.
Santosh Vempala
.
FSTTCS,
volume 18 of LIPIcs,
page 48-57.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
(
2012
)
Santosh Vempala
.
FSTTCS,
volume 18 of LIPIcs,
page 48-57.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
(
2012
)
5 months and 7 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Cutting Plane Method Is Polynomial for Perfect Matchings.
Karthekeyan Chandrasekaran
,
László A. Végh
, and
Santosh Vempala
.
FOCS,
page 571-580.
IEEE Computer Society,
(
2012
)
Karthekeyan Chandrasekaran
,
László A. Végh
, and
Santosh Vempala
.
FOCS,
page 571-580.
IEEE Computer Society,
(
2012
)
5 months and 10 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms.
Daniel Dadush
, and
Santosh Vempala
.
SODA,
page 1445-1456.
SIAM,
(
2012
)
Daniel Dadush
, and
Santosh Vempala
.
SODA,
page 1445-1456.
SIAM,
(
2012
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Convex Relaxation for the Asymmetric TSP.
Santosh Vempala
, and
Mihalis Yannakakis
.
SODA,
page 975-976.
ACM/SIAM,
(
1999
)
Santosh Vempala
, and
Mihalis Yannakakis
.
SODA,
page 975-976.
ACM/SIAM,
(
1999
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Clustering in Large Graphs and Matrices.
Petros Drineas
,
Alan M. Frieze
,
Ravi Kannan
,
Santosh Vempala
, and
V. Vinay
.
SODA,
page 291-299.
ACM/SIAM,
(
1999
)
Petros Drineas
,
Alan M. Frieze
,
Ravi Kannan
,
Santosh Vempala
, and
V. Vinay
.
SODA,
page 291-299.
ACM/SIAM,
(
1999
)
5 months and 14 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies.
Karthekeyan Chandrasekaran
,
Daniel Dadush
, and
Santosh Vempala
.
SODA,
page 1630-1645.
SIAM,
(
2010
)
Karthekeyan Chandrasekaran
,
Daniel Dadush
, and
Santosh Vempala
.
SODA,
page 1630-1645.
SIAM,
(
2010
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Towards a 4/3 approximation for the asymmetric traveling salesman problem.
Robert D. Carr
,
Santosh Vempala
, and
Jacques Mandler
.
SODA,
page 116-125.
ACM/SIAM,
(
2000
)
Robert D. Carr
,
Santosh Vempala
, and
Jacques Mandler
.
SODA,
page 116-125.
ACM/SIAM,
(
2000
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Algorithms for Implicit Hitting Set Problems.
Karthekeyan Chandrasekaran
,
Richard Karp
,
Erick Moreno-Centeno
, and
Santosh Vempala
.
SODA,
page 614-629.
SIAM,
(
2011
)
Karthekeyan Chandrasekaran
,
Richard Karp
,
Erick Moreno-Centeno
, and
Santosh Vempala
.
SODA,
page 614-629.
SIAM,
(
2011
)
5 months and 14 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Expanders via random spanning trees.
Navin Goyal
,
Luis Rademacher
, and
Santosh Vempala
.
SODA,
page 576-585.
SIAM,
(
2009
)
Navin Goyal
,
Luis Rademacher
, and
Santosh Vempala
.
SODA,
page 576-585.
SIAM,
(
2009
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments Extended Abstract.
Ravi Kannan
,
Prasad Tetali
, and
Santosh Vempala
.
SODA,
page 193-200.
ACM/SIAM,
(
1997
)
Ravi Kannan
,
Prasad Tetali
, and
Santosh Vempala
.
SODA,
page 193-200.
ACM/SIAM,
(
1997
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Local versus global properties of metric spaces.
Sanjeev Arora
,
László Lovász
,
Ilan Newman
,
Yuval Rabani
,
Yuri Rabinovich
, and
Santosh Vempala
.
SODA,
page 41-50.
ACM Press,
(
2006
)
Sanjeev Arora
,
László Lovász
,
Ilan Newman
,
Yuval Rabani
,
Yuri Rabinovich
, and
Santosh Vempala
.
SODA,
page 41-50.
ACM Press,
(
2006
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Matrix approximation and projective clustering via volume sampling.
Amit Deshpande
,
Luis Rademacher
,
Santosh Vempala
, and
Grant Wang
.
SODA,
page 1117-1126.
ACM Press,
(
2006
)
Amit Deshpande
,
Luis Rademacher
,
Santosh Vempala
, and
Grant Wang
.
SODA,
page 1117-1126.
ACM Press,
(
2006
)
5 months and 14 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques.
Naveen Garg
,
Santosh Vempala
, and
Aman Singla
.
SODA,
page 103-111.
ACM/SIAM,
(
1993
)
Naveen Garg
,
Santosh Vempala
, and
Aman Singla
.
SODA,
page 103-111.
ACM/SIAM,
(
1993
)
5 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Cutting Plane Method is Polynomial for Perfect Matchings
Karthekeyan Chandrasekaran
,
László A. Végh
, and
Santosh Vempala
.
CoRR
(
2012
)
Karthekeyan Chandrasekaran
,
László A. Végh
, and
Santosh Vempala
.
CoRR
(
2012
)
7 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
Daniel Stefankovic
,
Santosh Vempala
, and
Eric Vigoda
.
CoRR
(
2006
)
Daniel Stefankovic
,
Santosh Vempala
, and
Eric Vigoda
.
CoRR
(
2006
)
7 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Deterministic 2^On Algorithms for M-Ellipsoids, Lattice Problems and Volume Estimation
Daniel Dadush
, and
Santosh Vempala
.
CoRR
(
2012
)
Daniel Dadush
, and
Santosh Vempala
.
CoRR
(
2012
)
7 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact