On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors.
W. S. BrownPublished in: J. ACM (1971)
Keyphrases
- preprocessing
- detection algorithm
- computational cost
- learning algorithm
- artificial neural networks
- k means
- dynamic programming
- recognition algorithm
- significant improvement
- cost function
- segmentation algorithm
- similarity measure
- theoretical analysis
- computationally efficient
- high accuracy
- optimal solution
- particle swarm optimization
- image registration
- experimental evaluation
- computational complexity
- matching algorithm
- convergence rate
- improved algorithm
- parallel implementation
- efficient computation
- previously computed
- polynomially bounded