34 search results - page 2 / 7 » Inexact Matching of Ontology Graphs Using Expectation-Maximi... |
FLAIRS
2006
13 years 6 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
KCAP
2003
ACM
13 years 10 months ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
ICMCS
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...