103 search results - page 11 / 21 » Adaptive Matching Based Kernels for Labelled Graphs |
GBRPR
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
135
click to vote
EMMCVPR
2005
Springer
15 years 7 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
134
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
100
click to vote
OTM
2005
Springer
15 years 6 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
129
click to vote
JODS
2007
15 years 1 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...