How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fields.
Qiang ZhouChengliang TianHanlin ZhangJia YuFengjun LiPublished in: Inf. Sci. (2020)
Keyphrases
- optimal solution
- computational complexity
- objective function
- k means
- linear programming
- high accuracy
- dynamic programming
- segmentation algorithm
- expectation maximization
- experimental evaluation
- optimization algorithm
- computationally efficient
- particle swarm optimization
- worst case
- np hard
- tree structure
- cost function
- multi objective
- matching algorithm
- improved algorithm
- similarity measure
- square root
- recognition algorithm
- computer vision
- detection algorithm
- significant improvement
- preprocessing
- bayesian networks
- clustering algorithm