78 search results - page 9 / 16 » Approximate earth mover's distance in linear time |
76
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
89
Voted
ALGORITHMICA
2005
14 years 9 months ago
2005
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
91
Voted
COMPGEOM
2000
ACM
15 years 1 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
72
Voted
CCCG
1993
14 years 11 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...