1248 search results - page 49 / 250 » On the Number of Birch Partitions |
111
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
152
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
We present a methodology for off-chip memory bandwidth minimization through application-driven L2 cache partitioning in multicore systems. A major challenge with multi-core system...
150
Voted
DATAMINE
1999
15 years 1 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a method for merging multiple partitions into a single partition, by minimising the ratio of pairwise agreements and contradictions between the equivalence relations cor...
106
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...