A modular GCD algorithm over number fields presented with multiple extensions.
Mark van HoeijMichael B. MonaganPublished in: ISSAC (2002)
Keyphrases
- learning algorithm
- objective function
- detection algorithm
- cost function
- memory requirements
- computational complexity
- dynamic programming
- significant improvement
- single scan
- computational effort
- improved algorithm
- times faster
- probabilistic model
- high accuracy
- expectation maximization
- matching algorithm
- data sets
- space complexity
- selection algorithm
- similarity measure
- optimization algorithm
- particle swarm optimization
- maximum likelihood
- computational cost
- experimental evaluation
- theoretical analysis
- preprocessing
- search space
- path planning
- optimal solution
- convex hull
- input data
- feature selection
- computer vision
- execution times
- randomized algorithm