1346 search results - page 138 / 270 » On the number of rectangular partitions |
IJCSA
2006
14 years 10 months ago
2006
Approaches to indexing and searching feature vectors are an indispensable factor to support similarity search effectively and efficiently. Such feature vectors extracted from real...
PAMI
2006
14 years 10 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
SIAMJO
2008
14 years 10 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
MCS
2007
Springer
14 years 10 months ago
2007
Springer
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
DCG
2002
2002
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
14 years 10 months ago
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...