Sciweavers

3192 search results - page 2 / 639
» The minimum latency problem
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 3 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
FOCS
2003
IEEE
13 years 11 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...
CVPR
2010
IEEE
14 years 2 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
CVPR
2010
IEEE
13 years 2 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
STOC
1994
ACM
91views Algorithms» more  STOC 1994»
13 years 10 months ago
The minimum latency problem
Avrim Blum, Prasad Chalasani, Don Coppersmith, Wil...