Sciweavers

1284 search results - page 9 / 257
» Data Structures for Mergeable Trees
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 6 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
AUSDM
2006
Springer
114views Data Mining» more  AUSDM 2006»
13 years 10 months ago
Consolidated Trees: An Analysis of Structural Convergence
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
Jesús M. Pérez, Javier Muguerza, Ola...
AROBOTS
2011
13 years 1 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...
DAGSTUHL
2006
13 years 8 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
FCT
2001
Springer
13 years 11 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...