A note on the number of division steps in the Euclidean algorithm.
Sergei A. AbramovPublished in: SIGSAM Bull. (2000)
Keyphrases
- computational complexity
- detection algorithm
- computational effort
- learning algorithm
- high accuracy
- computational cost
- memory requirements
- improved algorithm
- preprocessing
- space complexity
- theoretical analysis
- significant improvement
- k means
- dynamic programming
- worst case
- times faster
- matching algorithm
- single scan
- expectation maximization
- simulated annealing
- small number
- experimental evaluation
- search space
- optimal solution
- input data
- distance measure
- computationally efficient
- optimization algorithm
- ant colony optimization
- probabilistic model
- cost function
- multi objective
- similarity measure