43 search results - page 3 / 9 » Faster and Better Spectral Algorithms for Multi-Way Partitio... |
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Since a large number of clustering algorithms exist, aggregating different clustered partitions into a single consolidated one to obtain better results has become an important pro...
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we present a novel statistical full-chip leakage power analysis method. The new method can provide a general framework to derive the full-chip leakage current or po...
ICCAD
2001
IEEE
14 years 2 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...