-Tree: A New Overlay with Deterministic Bounds.

Gerth Stølting Brodal Spyros Sioutas Kostas Tsichlas Christos D. Zaroliagis

Published in: ISAAC (2) (2010)

Keyphrases

randomized algorithms
upper bound
tree structure
lower bound
upper and lower bounds
tree construction
spanning tree
tight bounds
tree models
similarity search
error bounds
binary tree
regression trees
b tree
black box
data sets
worst case
data structure
neural network