352 search results - page 2 / 71 » On implementation choices for iterative improvement partitio... |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
ASYNC
2004
IEEE
13 years 9 months ago
2004
IEEE
One of the main reasons for using asynchronous design is that it offers the opportunity to exploit the datadependent latency of many operations in order to achieve low-power, high...
EURODAC
1995
IEEE
13 years 8 months ago
1995
IEEE
: This paper introduces a modified relaxation approach that allows to improve the convergence of iterations while analyzing mixed systems with different simulators. The method redu...
ACCV
2009
Springer
13 years 11 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
ASPDAC
2000
ACM
13 years 9 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...