85 search results - page 12 / 17 » Improved Algorithms for Uniform Partitions of Points |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
DAC
2005
ACM
16 years 20 days ago
2005
ACM
MiniBit, our automated approach for optimizing bit-widths of fixed-point designs is based on static analysis via affine arithmetic. We describe methods to minimize both the intege...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
SIAMCOMP
2008
14 years 11 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...