Sciweavers

759 search results - page 32 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 4 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde
87
Voted
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
59
Voted
IPMI
2005
Springer
15 years 10 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...
129
Voted
CVPR
2010
IEEE
15 years 6 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
CSCLP
2008
Springer
14 years 11 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig