1632 search results - page 64 / 327 » Sublinear Time Algorithms for Metric Space Problems |
154
click to vote
AAIM
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
162
Voted
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
139
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Image segmentation is the first stage of processing in many practical computer vision systems. While development of particular segmentation algorithms has attracted considerable re...
144
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
126
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...