A redundant binary Euclidean GCD algorithm.
Shrikant N. ParikhDavid W. MatulaPublished in: IEEE Symposium on Computer Arithmetic (1991)
Keyphrases
- learning algorithm
- detection algorithm
- experimental evaluation
- np hard
- k means
- computational cost
- preprocessing
- worst case
- high accuracy
- binary tree
- computational complexity
- dynamic programming
- optimal solution
- times faster
- objective function
- optimization algorithm
- similarity measure
- improved algorithm
- recognition algorithm
- path planning
- matching algorithm
- clustering method
- constraint satisfaction problems
- linear programming
- segmentation algorithm
- distance function
- expectation maximization
- simulated annealing
- convergence rate
- input image
- probabilistic model
- non binary
- cost function
- bit string