56 search results - page 3 / 12 » Bayesian Graph Edit Distance |
BPM
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Kaspar Riesen, Stefan Fankhauser and Horst Bunke2
JCT
2008
13 years 7 months ago
2008
RSA
2008
13 years 6 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...