234 search results - page 13 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
122
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
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...
MSV
2004
14 years 11 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
PKDD
2000
Springer
15 years 1 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
CPC
2002
14 years 9 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
GD
1998
Springer
15 years 1 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...