On the Genericity of the Modular Polynomial GCD Algorithm.
Erich KaltofenMichael B. MonaganPublished in: ISSAC (1999)
Keyphrases
- dynamic programming
- cost function
- matching algorithm
- learning algorithm
- objective function
- detection algorithm
- optimization algorithm
- polynomially bounded
- computational complexity
- search space
- k means
- improved algorithm
- experimental evaluation
- simulated annealing
- linear programming
- theoretical analysis
- np hard
- optimal solution
- input data
- neural network
- high accuracy
- classification algorithm
- times faster
- bayesian framework
- memory requirements
- significant improvement
- estimation algorithm
- synthetic and real images
- randomized approximation