1951 search results - page 281 / 391 » An algorithm for improving graph partitions |
137
click to vote
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently graph-cut optimization has been extensively explored for interactive image segmentation. In this paper we propose Discriminative Gaussian Mixtures (DGMs) to boost the per...
126
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
114
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
126
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
129
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...