1056 search results - page 51 / 212 » Constraint-Based Graph Matching |
132
click to vote
CIVR
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
160
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
132
click to vote
ICSM
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
116
click to vote
CVIU
2006
15 years 2 months ago
2006
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
107
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...