20 search results - page 1 / 4 » Efficient Reorganization of Binary Search Trees |
CIAC
1994
Springer
14 years 3 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
IPL
2002
13 years 10 months ago
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
TIP
2008
13 years 11 months ago
2008
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
SWAT
1992
Springer
14 years 3 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...