909 search results - page 46 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
122
click to vote
DEXA
2006
Springer
15 years 5 months ago
2006
Springer
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
118
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
107
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
144
click to vote
PVM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
125
click to vote
CIKM
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...