102 search results - page 10 / 21 » Improved Bounds for Geometric Permutations |
102
click to vote
COMPGEOM
2009
ACM
15 years 6 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....
101
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
132
click to vote
TCAD
2008
15 years 1 months ago
2008
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
118
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
116
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...