Author pages are created from data sourced from our academic publisher partnerships and public sources.
Inexact graph matching by means of estimation of distribution algorithms
- E. Bengoetxea, P. Larrañaga, I. Bloch, A. Perchant, Claudia Boeres
- Mathematics, Computer Science
- Pattern Recognit.
- 1 December 2002
We propose to use EDA algorithms as a new approach for inexact graph matching which is NP-hard and requires techniques to find an approximate acceptable solution. Expand
Model-Based Scene Recognition Using Graph Fuzzy Homomorphism Solved By Genetic Algorithm
Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison b
Comparando mapas conceituais utilizando correspondência de grafos
The problem of graph correspondence consists of a mathematical formulation for model-based image recognition. Expand
Model-based scene recognition using graph fuzzy homomorphism solvedby genetic
We present in this paper a new formalism for graph matching, based on fuzzy homomorphism. Expand