A 'rotating' and 'folding' algorithm using a two-dimensional 'systolic' communication geometry.
M. P. BekakosDavid J. EvansPublished in: Parallel Comput. (1987)
Keyphrases
- learning algorithm
- experimental evaluation
- three dimensional
- optimization algorithm
- computational complexity
- k means
- detection algorithm
- preprocessing
- improved algorithm
- dynamic programming
- computationally efficient
- linear programming
- path planning
- probabilistic model
- matching algorithm
- tree structure
- times faster
- packing problem
- theoretical analysis
- simulated annealing
- genetic algorithm
- computational cost
- np hard
- hidden markov models
- significant improvement
- similarity measure
- input data
- multi dimensional
- search space
- optimal solution
- objective function
- geometric features