A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube
Volker HeunErnst W. MayrPublished in: Forschungsberichte, TU Munich (1993)
Keyphrases
- binary tree
- dynamic programming
- worst case
- optimal solution
- single pass
- computationally efficient
- quadtree
- k means
- cost function
- detection algorithm
- learning algorithm
- exhaustive search
- parallel algorithm
- expectation maximization
- simulated annealing
- image processing
- databases
- tree structure
- multi dimensional
- computational complexity
- image segmentation