Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation.
Gavin HarrisonJeremy R. JohnsonB. David SaundersPublished in: J. Symb. Comput. (2016)
Keyphrases
- learning algorithm
- dynamic programming
- times faster
- experimental evaluation
- probabilistic model
- improved algorithm
- preprocessing
- matching algorithm
- polynomially bounded
- optimal solution
- search space
- graphical models
- classification algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- k means
- objective function
- expectation maximization
- data sets
- high accuracy
- segmentation algorithm
- computational cost
- detection algorithm
- cost function
- significant improvement
- recognition algorithm
- similarity measure
- context free parsing