Sciweavers

1284 search results - page 2 / 257
» Data Structures for Mergeable Trees
Sort
View
CMIG
2010
125views more  CMIG 2010»
13 years 12 days 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
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 12 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
DATESO
2009
101views Database» more  DATESO 2009»
13 years 3 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
SAC
2002
ACM
13 years 5 months ago
Decision tree classification of spatial data streams using Peano Count Trees
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...
Qiang Ding, Qin Ding, William Perrizo
TOIS
2002
97views more  TOIS 2002»
13 years 5 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams