144 search results - page 18 / 29 » A speculation-friendly binary search tree |
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
DLOG
2007
13 years 10 months ago
2007
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...