179 search results - page 8 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
114
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
136
click to vote
CP
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
121
click to vote
RECOMB
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
108
click to vote
JCB
2000
15 years 2 months ago
2000
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...