An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p).
Jacques CalmetRüdiger LoosPublished in: Inf. Process. Lett. (1980)
Keyphrases
- significant improvement
- probabilistic model
- learning algorithm
- expectation maximization
- np hard
- experimental evaluation
- cost function
- preprocessing
- times faster
- matching algorithm
- improved algorithm
- optimization algorithm
- context free parsing
- tree structure
- clustering method
- estimation algorithm
- theoretical analysis
- generative model
- high accuracy
- computational cost
- computational complexity
- optimal solution
- em algorithm
- linear programming
- least squares
- path planning
- convergence rate
- recognition algorithm
- similarity measure
- image sequences