Performances of an Algorithm Constructing a Nearly Optimal Binary Tree.
Herman AkdagPublished in: Acta Informatica (1983)
Keyphrases
- binary tree
- worst case
- dynamic programming
- optimal solution
- computational cost
- learning algorithm
- k means
- cost function
- np hard
- preprocessing
- globally optimal
- search space
- classification algorithm
- binary trees
- matching algorithm
- optimal parameters
- databases
- detection algorithm
- multiscale
- computational complexity
- hierarchical structure
- exhaustive search
- image segmentation
- search engine
- machine learning