Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance.
Jussi KujalaTapio ElomaaPublished in: ISAAC (2006)
Keyphrases
- data structure
- worst case
- average case
- upper bound
- lower bound
- efficient data structures
- greedy algorithm
- error bounds
- approximation algorithms
- np hard
- space efficient
- suffix tree
- quadtree
- running times
- information systems
- tree structure
- sample size
- data types
- real time
- special case
- optimal solution
- learning algorithm
- machine learning
- data mining