On the distribution of the number of computations in any finite number of subtrees for the stack algorithm.
Rolf JohannessonKamil Sh. ZigangirovPublished in: IEEE Trans. Inf. Theory (1985)
Keyphrases
- finite number
- extreme points
- computational complexity
- dynamic programming
- high accuracy
- experimental evaluation
- memory requirements
- tree structure
- cost function
- space complexity
- np hard
- significant improvement
- preprocessing
- single scan
- detection algorithm
- times faster
- optimization algorithm
- particle swarm optimization
- learning algorithm
- worst case
- higher dimensional
- data structure
- fixed number
- recognition algorithm
- simulated annealing
- matching algorithm
- mathematical model
- motion estimation
- computational cost
- k means
- search space
- optimal solution