Toward the best algorithm for approximate GCD of univariate polynomials.
Kosaku NagasakaPublished in: J. Symb. Comput. (2021)
Keyphrases
- learning algorithm
- times faster
- experimental evaluation
- preprocessing
- optimization algorithm
- k means
- computational cost
- clustering method
- significant improvement
- np hard
- dynamic programming
- high accuracy
- objective function
- improved algorithm
- segmentation algorithm
- cost function
- computational complexity
- input image
- knn
- search space
- detection algorithm
- matching algorithm
- path planning
- search algorithm
- memory requirements
- data structure
- synthetic and real images