144 search results - page 23 / 29 » A speculation-friendly binary search tree |
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
VMV
2001
13 years 9 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
ALGORITHMICA
2005
13 years 7 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
EMO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...