676 search results - page 49 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
ALENEX
2007
15 years 3 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
128
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
129
click to vote
SLSFS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
110
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
135
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...