144 search results - page 23 / 29 » Improved Approximation Algorithms for Metric Max TSP |
ALENEX
2001
13 years 8 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
ISMIR
2005
Springer
14 years 25 days ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
COCOA
2009
Springer
13 years 10 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
We propose novel approaches for optimizing the detection performance in spoken language recognition. Two objective functions are designed to directly relate model parameters to tw...
FOCS
2010
IEEE
13 years 5 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...