Sciweavers

1248 search results - page 1 / 250
» On the Number of Birch Partitions
Sort
View
DCG
2008
88views more  DCG 2008»
13 years 10 months ago
On the Number of Birch Partitions
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
Stephan Hell
JCT
1998
70views more  JCT 1998»
13 years 9 months ago
Partitions into Distinct Parts and Elliptic Curves
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
Ken Ono
VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 2 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
14 years 3 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 9 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...