Sciweavers

310 search results - page 8 / 62
» Randomized Binary Search Trees
Sort
View
PPOPP
2012
ACM
12 years 5 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 10 months ago
Learning relational probability trees
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...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
FSTTCS
2004
Springer
14 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
DMTCS
2002
108views Mathematics» more  DMTCS 2002»
13 years 9 months ago
The height of q-Binary Search Trees
Abstract. q
Michael Drmota, Helmut Prodinger