Sciweavers

672 search results - page 48 / 135
» Lower-stretch spanning trees
Sort
View
OPODIS
2004
13 years 10 months ago
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
Hirotsugu Kakugawa, Masafumi Yamashita
MICCAI
2005
Springer
14 years 9 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
ISITA
2010
13 years 6 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
GD
2004
Springer
14 years 2 months ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...
PDPTA
2003
13 years 10 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan