Speeding up Euclid's GCD algorithm with no magnitude comparisons.
Che Wun ChiouFu-Hua ChouYun-Chi YehPublished in: Int. J. Inf. Comput. Secur. (2010)
Keyphrases
- dynamic programming
- computational complexity
- learning algorithm
- objective function
- cost function
- estimation algorithm
- detection algorithm
- preprocessing
- experimental evaluation
- np hard
- path planning
- times faster
- convergence rate
- recognition algorithm
- k means
- theoretical analysis
- optimization algorithm
- selection algorithm
- improved algorithm
- synthetic and real images
- linear programming
- matching algorithm
- image restoration
- segmentation algorithm
- search space
- lower bound
- video sequences
- optimal solution
- image processing