43 search results - page 7 / 9 » Faster and Better Spectral Algorithms for Multi-Way Partitio... |
PODS
2005
ACM
14 years 10 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
ALMOB
2006
13 years 9 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
IPPS
2008
IEEE
14 years 4 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
DATE
2003
IEEE
14 years 3 months ago
2003
IEEE
– Floorplanning large designs with many hard macros and IP blocks of various sizes is becoming an increasingly important and challenging problem. This paper presents a global flo...