Sciweavers

814 search results - page 94 / 163
» Graphical Models for Graph Matching
Sort
View
CP
2009
Springer
14 years 9 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
CIMCA
2005
IEEE
14 years 2 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
GD
2003
Springer
14 years 2 months ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
CVPR
2005
IEEE
14 years 11 months ago
Dense Photometric Stereo Using a Mirror Sphere and Graph Cut
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
Tai-Pang Wu, Chi-Keung Tang
ICCV
2007
IEEE
14 years 11 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára