11 search results - page 2 / 3 » Approximating TSP on metrics with bounded global growth |
TSP
2010
12 years 11 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
GMP
2006
IEEE
13 years 10 months ago
2006
IEEE
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
IMR
2004
Springer
13 years 10 months ago
2004
Springer
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...