3055 search results - page 105 / 611 » Randomized Search Trees |
IJCAI
2001
13 years 11 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
ALGORITHMICA
2010
13 years 10 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
SIGMOD
2001
ACM
14 years 10 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...