478 search results - page 32 / 96 » Measuring the Similarity of Labeled Graphs |
CLEF
2007
Springer
14 years 3 months ago
2007
Springer
This paper presents my participation to the second Morpho Challenge. Results have been obtained with the algorithm already presented at Morpho Challenge 2005. The system takes a p...
FCT
2009
Springer
14 years 4 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
JASIS
2007
13 years 9 months ago
2007
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
SSPR
1998
Springer
14 years 1 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
CCA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...