101 search results - page 8 / 21 » Graph Partition by Swendsen-Wang Cuts |
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
85
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...