A New Algorithm and Refined Bounds for Extended Gcd Computation.
David FordGeorge HavasPublished in: ANTS (1996)
Keyphrases
- computationally efficient
- learning algorithm
- experimental evaluation
- cost function
- preprocessing
- significant improvement
- worst case
- computational complexity
- improved algorithm
- recognition algorithm
- dynamic programming
- objective function
- times faster
- lower and upper bounds
- high accuracy
- convergence rate
- monte carlo
- optimization algorithm
- tight bounds
- expectation maximization
- neural network
- k means
- genetic algorithm
- detection algorithm
- matching algorithm
- upper bound
- error bounds
- np hard
- optimal solution
- hardware implementation
- similarity measure
- upper and lower bounds