136 search results - page 13 / 28 » Learning probabilistic models of tree edit distance |
SIGIR
2010
ACM
14 years 10 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...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
CIA
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach a...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...
ERCIMDL
2009
Springer
15 years 4 months ago
2009
Springer
An effective graphic interface is a key tool to improve the fruition of the results retrieved by an Information Retrieval (IR) system. In this work, we describe a two-dimensional...