A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis.
Ahmed ZidnaDominique MichelPublished in: Math. Comput. Simul. (2008)
Keyphrases
- experimental evaluation
- optimal solution
- dynamic programming
- detection algorithm
- optimization algorithm
- times faster
- high accuracy
- single pass
- computational cost
- ant colony optimization
- worst case
- preprocessing
- cost function
- probabilistic model
- multi step
- data structure
- theoretical analysis
- image sequences
- decision trees
- randomized approximation
- parametric curves
- improved algorithm
- matching algorithm
- data sets
- computationally efficient
- expectation maximization
- input data
- support vector machine
- significant improvement
- computational complexity
- learning algorithm