Algorithms which extend the Euclidean algorithm to a vector, to non-integers, and for finding the L.C.M.
Michael CoxPublished in: ACM SIGAPL APL Quote Quad (1976)
Keyphrases
- learning algorithm
- computational cost
- theoretical analysis
- computational complexity
- recently developed
- times faster
- synthetic and real world datasets
- computationally efficient
- algorithms require
- single pass
- computational efficiency
- matching algorithm
- preprocessing
- filtering algorithm
- empirical analyses
- image processing algorithms
- worst case
- classification algorithm
- significant improvement
- related algorithms
- space complexity
- hybrid algorithm
- synthetic and real datasets
- incremental version
- combinatorial optimization
- optimization algorithm
- dynamic programming
- iterative algorithms
- similarity measure
- objective function
- optimal solution
- computationally demanding
- theoretical guarantees
- convergence rate
- memory requirements
- benchmark problems
- simulated annealing
- np hard
- apriori algorithm
- cost function
- detection algorithm
- synthetic datasets
- sparse matrix