179 search results - page 13 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
84
Voted
CLEF
2005
Springer
15 years 3 months ago
2005
Springer
This year we participated at 4 Question Answering tasks at CLEF: the Italian monolingual (I), Italian-English (I/E), Bulgarian monolingual (B), and Bulgarian-English (B/E) bilingu...
ER
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
100
click to vote
AAAI
2011
13 years 9 months ago
2011
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
MST
2011
14 years 4 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
69
Voted
JDA
2007
14 years 9 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...