A sparse modular GCD algorithm for polynomials over algebraic function fields.
Seyed Mohammad Mahdi JavadiMichael B. MonaganPublished in: ISSAC (2007)
Keyphrases
- optimization algorithm
- dynamic programming
- search space
- improved algorithm
- detection algorithm
- objective function
- preprocessing
- learning algorithm
- significant improvement
- np hard
- simulated annealing
- high accuracy
- computational cost
- optimal solution
- cost function
- high dimensional
- experimental evaluation
- worst case
- computational complexity
- computationally efficient
- theoretical analysis
- segmentation algorithm
- evolutionary algorithm
- lower bound
- feature space
- bayesian networks
- sparse representation
- recognition algorithm
- decision trees