A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.
Volker HeunErnst W. MayrPublished in: J. Algorithms (1996)
Keyphrases
- binary tree
- dynamic programming
- optimal solution
- learning algorithm
- single pass
- computational complexity
- detection algorithm
- worst case
- search space
- cost function
- k means
- objective function
- np hard
- probabilistic model
- multiclass svm
- tree representation
- exhaustive search
- machine learning
- computationally efficient
- expectation maximization
- image compression
- support vector
- database systems
- search engine
- genetic algorithm