179 search results - page 27 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We present GoGetIt!, a tool for generating structure-driven crawlers that requires a minimum effort from the users. The tool takes as input a sample page and an entry point to a W...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
114
click to vote
ADC
2007
Springer
15 years 1 months ago
2007
Springer
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...