Algorithms for the non-monic case of the sparse modular GCD algorithm.
Jennifer de KleineMichael B. MonaganAllan D. WittkopfPublished in: ISSAC (2005)
Keyphrases
- times faster
- learning algorithm
- computational cost
- computational complexity
- recently developed
- computationally efficient
- single pass
- computational efficiency
- worst case
- theoretical analysis
- synthetic and real world datasets
- significant improvement
- dynamic programming
- combinatorial optimization
- filtering algorithm
- maximum flow
- iterative algorithms
- optimization algorithm
- classification algorithm
- related algorithms
- image processing algorithms
- convergence rate
- memory requirements
- objective function
- detection algorithm
- cost function
- empirical analyses
- optimal solution
- search space
- theoretical guarantees
- np hard
- space complexity
- solution quality
- hybrid algorithm
- segmentation algorithm
- exhaustive search
- synthetic datasets
- multi objective
- evolutionary algorithm
- algorithms require
- particle swarm optimization
- preprocessing
- noisy data
- matching algorithm