A fast selective traversal algorithm for binary search trees.
Tohru KikunoNoriyoshi YoshidaHiromi KusumotoPublished in: COMPSAC (1979)
Keyphrases
- experimental evaluation
- binary search trees
- detection algorithm
- cost function
- learning algorithm
- np hard
- k means
- worst case
- expectation maximization
- optimization algorithm
- tree structure
- computational complexity
- preprocessing
- matching algorithm
- similarity measure
- probabilistic model
- recognition algorithm
- constraint satisfaction
- database systems
- computational cost
- genetic algorithm
- data structure
- optimal solution