A fast parallel sparse polynomial GCD algorithm.
Jiaxiong HuMichael B. MonaganPublished in: J. Symb. Comput. (2021)
Keyphrases
- parallel implementation
- cost function
- detection algorithm
- objective function
- computational complexity
- learning algorithm
- times faster
- k means
- dynamic programming
- worst case
- optimization algorithm
- high accuracy
- search space
- np hard
- polynomially bounded
- expectation maximization
- improved algorithm
- matching algorithm
- search algorithm
- parallel version
- depth first search
- similarity measure
- parallel processing
- optimal solution
- association rules
- segmentation algorithm
- linear programming
- neural network
- computational cost