On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers.
Heinrich RolletschekPublished in: J. Symb. Comput. (1986)
Keyphrases
- computational complexity
- learning algorithm
- detection algorithm
- experimental evaluation
- computational cost
- high accuracy
- search space
- space complexity
- memory requirements
- cost function
- np hard
- optimization algorithm
- execution times
- computational effort
- convergence rate
- matching algorithm
- segmentation algorithm
- expectation maximization
- dynamic programming
- k means