2681 search results - page 232 / 537 » Problem F |
104
Voted
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
96
Voted
COMPGEOM
2009
ACM
15 years 5 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....
113
click to vote
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
118
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
142
click to vote
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...