Sciweavers

4911 search results - page 27 / 983
» Tree dependence analysis
Sort
View
JUCS
2007
148views more  JUCS 2007»
13 years 7 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
CPC
2008
74views more  CPC 2008»
13 years 7 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye
CMIG
2010
125views more  CMIG 2010»
13 years 2 months ago
VascuSynth: Simulating vascular trees for generating volumetric image data with ground-truth segmentation and tree analysis
Automated segmentation and analysis of tree-like structures from 3D medical images are important for many medical applications, such as those dealing with blood vasculature or lun...
Ghassan Hamarneh, Preet Jassi
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff