15 search results - page 2 / 3 » The number of guillotine partitions in d dimensions |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
ESWS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The paper presents a clustering method which can be applied to populated ontologies for discovering interesting groupings of resources therein. The method exploits a simp...
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
SODA
2010
ACM
14 years 2 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 ...
COMPGEOM
2009
ACM
13 years 10 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....