Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms.
Eda CesarattoJulien ClémentBenoit DaireauxLoïck LhoteVéronique Maume-DeschampsBrigitte ValléePublished in: J. Symb. Comput. (2009)
Keyphrases
- computational complexity
- times faster
- learning algorithm
- computational cost
- space complexity
- theoretical analysis
- recently developed
- algorithms require
- worst case
- empirical analyses
- single pass
- significant improvement
- k means
- hybrid algorithm
- filtering algorithm
- computationally efficient
- synthetic and real datasets
- classification algorithm
- computational efficiency
- image processing algorithms
- benchmark problems
- objective function
- complexity analysis
- computationally intensive
- synthetic datasets
- np hard
- iterative algorithms
- search space
- synthetic and real world datasets
- related algorithms
- dynamic programming
- maximum flow
- incremental algorithms
- theoretical guarantees
- feature selection
- highly efficient
- hardware implementation
- convergence rate
- data clustering
- combinatorial optimization
- optimization algorithm
- segmentation algorithm
- apriori algorithm
- noisy data
- fast fourier transform
- particle swarm optimization
- markov random field
- cost function
- lower bound
- preprocessing
- provably convergent