IJCV
2007
13 years 11 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
IPL
2008
13 years 11 months ago
2008
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
FOCS
2004
IEEE
14 years 3 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
STACS
2009
Springer
14 years 6 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...