An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields.
Stéphane BalletPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- learning algorithm
- linear programming
- optimization algorithm
- classification algorithm
- segmentation algorithm
- simulated annealing
- significant improvement
- experimental evaluation
- worst case
- computational complexity
- preprocessing
- cost function
- dynamic programming
- theoretical analysis
- image segmentation
- high accuracy
- matching algorithm
- computational cost
- k means
- convergence rate
- lower bound
- data sets
- single pass
- detection algorithm
- recognition algorithm
- parallel implementation
- expectation maximization
- particle swarm optimization
- least squares
- evolutionary algorithm
- search space
- objective function
- multiscale