A note on Gao's algorithm for polynomial factorization.
Carlos HoppenVirginia M. RodriguesVilmar TrevisanPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- improved algorithm
- learning algorithm
- experimental evaluation
- detection algorithm
- search space
- np hard
- k means
- cost function
- dynamic programming
- simulated annealing
- theoretical analysis
- computationally efficient
- expectation maximization
- iterative algorithms
- linear programming
- high accuracy
- times faster
- preprocessing
- negative matrix factorization
- significant improvement
- segmentation algorithm
- randomized approximation
- particle swarm optimization
- input data
- worst case
- probabilistic model
- multi objective
- search algorithm
- bayesian networks