1951 search results - page 135 / 391 » An algorithm for improving graph partitions |
152
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
129
Voted
ICEC
1994
15 years 5 months ago
1994
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
135
click to vote
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
124
Voted
TVLSI
2002
15 years 4 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
177
click to vote
JMLR
2010
14 years 11 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...