One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithm.
Timothy J. RolfePublished in: ACM SIGCSE Bull. (2002)
Keyphrases
- preprocessing
- detection algorithm
- learning algorithm
- computational complexity
- binary search trees
- combinatorial optimization
- optimal solution
- simulated annealing
- matching algorithm
- dynamic programming
- high accuracy
- segmentation algorithm
- databases
- k means
- search space
- clustering method
- computational cost
- expectation maximization
- markov random field
- special case
- similarity measure
- neural network