676 search results - page 28 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
FOCS
2008
IEEE
14 years 12 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
114
click to vote
UAI
2008
15 years 1 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
DLT
2007
15 years 1 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
IPMU
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
111
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...