144 search results - page 8 / 29 » Non-blocking binary search trees |
SIAMCOMP
1998
14 years 9 months ago
1998
105
click to vote
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
IPL
2002
14 years 9 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...
120
click to vote
TIP
2008
14 years 9 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...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...