47 search results - page 1 / 10 » On Digital Search Trees - A Simple Method for Constructing B... |
ICSOFT
2007
13 years 6 months ago
2007
FLAIRS
2006
13 years 6 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
ACMSE
2007
ACM
13 years 8 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
IUI
2009
ACM
14 years 1 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...