Sciweavers

398 search results - page 45 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 1 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 10 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
ECCV
2002
Springer
14 years 9 months ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
ACCV
2007
Springer
14 years 1 months ago
Human Pose Estimation from Volume Data and Topological Graph Database
This paper proposes a novel volume-based motion capture method using a bottom-up analysis of volume data and an example topology database of the human body. By using a two-step gra...
Hidenori Tanaka, Atsushi Nakazawa, Haruo Takemura