18 search results - page 3 / 4 » A Probabilistic Approach to Learning Costs for Graph Edit Di... |
KDD
2008
ACM
14 years 6 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
It is becoming increasingly common to construct databases from information automatically culled from many heterogeneous sources. For example, a research publication database can b...
SIGIR
2010
ACM
13 years 5 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
CIVR
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...