On a Modular Algorithm for Computing GCDs of Polynomials over Algebraic Number Fields.
Mark J. EncarnaciónPublished in: ISSAC (1994)
Keyphrases
- algebraic geometry
- computational complexity
- dynamic programming
- cost function
- memory requirements
- experimental evaluation
- objective function
- np hard
- input data
- detection algorithm
- segmentation algorithm
- space complexity
- learning algorithm
- execution times
- significant improvement
- optimal solution
- data sets
- expectation maximization
- computationally efficient
- search space
- computational effort
- preprocessing
- times faster
- curve fitting
- initial set
- recognition algorithm
- convergence rate
- particle swarm optimization
- classification algorithm
- clustering method
- optimization algorithm
- high accuracy
- computational cost
- similarity measure
- computer vision
- genetic algorithm