179 search results - page 20 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
ESA
1995
Springer
13 years 11 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
SIROCCO
2001
13 years 9 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Wavelets provide a sparse representation for piecewise smooth signals in 1-D; however, separable extensions of wavelets to multiple dimensions do not achieve the same level of spa...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...