165 search results - page 1 / 33 » Using Eigenvectors to Partition Circuits |
INFORMS
2006
13 years 5 months ago
2006
DAC
1994
ACM
13 years 9 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
ICCV
2007
IEEE
14 years 7 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...
PAMI
2007
13 years 4 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...