Algorithm for Computing Bernstein-Sato Ideals Associated with a Polynomial Mapping.
Rouchdi BahloulPublished in: J. Symb. Comput. (2001)
Keyphrases
- times faster
- preprocessing
- significant improvement
- optimization algorithm
- improved algorithm
- np hard
- objective function
- optimal solution
- noisy data
- k means
- experimental evaluation
- data sets
- detection algorithm
- theoretical analysis
- simulated annealing
- ant colony optimization
- path planning
- estimation algorithm
- computationally efficient
- expectation maximization
- input data
- linear programming
- computational cost
- hidden markov models
- computational complexity
- feature selection
- learning algorithm