Sciweavers

613 search results - page 23 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
EUROPAR
2007
Springer
13 years 11 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
IPMI
2005
Springer
14 years 8 months ago
Design of Robust Vascular Tree Matching: Validation on Liver
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
Arnaud Charnoz, Vincent Agnus, Grégoire Mal...
FOSSACS
2009
Springer
14 years 2 months ago
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
Colin Stirling
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
AINA
2007
IEEE
14 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein