947 search results - page 54 / 190 » Discrete Geometry |
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
In this paper, we show that there exists a (k, ε)-coreset for k-median and k-means clustering of n points in IRd , which is of size independent of n. In particular, we construct ...
DGCI
2006
Springer
14 years 11 months ago
2006
Springer
We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the t...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...