199 search results - page 6 / 40 » Fast Algorithms for Computing Tree LCS |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
DOCENG
2006
ACM
14 years 1 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
EOR
2008
13 years 7 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...