179 search results - page 18 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
126
click to vote
JCIT
2008
14 years 11 months ago
2008
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
108
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
WABI
2001
Springer
15 years 4 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...