Sciweavers

1056 search results - page 36 / 212
» Constraint-Based Graph Matching
Sort
View
CVPR
2004
IEEE
16 years 2 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
113
Voted
ICPR
2008
IEEE
15 years 7 months ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...
113
Voted
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 26 days ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CVPR
2009
IEEE
16 years 7 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
127
Voted
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 4 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj