676 search results - page 77 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
152
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
204
click to vote
JMLR
2012
13 years 8 months ago
2012
This paper proposes a novel Bayesian approximation inference method for mixture modeling. Our key idea is to factorize marginal log-likelihood using a variational distribution ove...
280
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
177
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...