2031 search results - page 68 / 407 » On Tree-Constrained Matchings and Generalizations |
STACS
2004
Springer
15 years 3 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
ESWS
2007
Springer
15 years 4 months ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
KCAP
2005
ACM
15 years 3 months ago
2005
ACM
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...