Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials.
Paul CamionPublished in: IEEE Trans. Inf. Theory (1983)
Keyphrases
- improved algorithm
- detection algorithm
- high accuracy
- single pass
- k means
- optimal solution
- significant improvement
- np hard
- preprocessing
- computational complexity
- cost function
- dynamic programming
- optimization algorithm
- computationally efficient
- expectation maximization
- learning algorithm
- segmentation algorithm
- theoretical analysis
- matching algorithm
- times faster
- computational cost
- search space
- experimental study
- machine learning
- clustering method
- simulated annealing
- markov random field
- video sequences
- worst case
- experimental evaluation