A projection algorithm on the set of polynomials with two bounds.
Martin Campos PintoFrédérique CharlesBruno DesprésMaxime HerdaPublished in: Numer. Algorithms (2020)
Keyphrases
- experimental evaluation
- initial set
- learning algorithm
- optimal solution
- detection algorithm
- lower and upper bounds
- input data
- computational cost
- high accuracy
- worst case
- significant improvement
- np hard
- times faster
- expectation maximization
- decomposition algorithm
- probabilistic model
- search space
- projection method
- tight bounds
- average case
- confidence bounds
- projection operator
- convergence rate
- similarity measure
- error bounds
- clustering method
- linear programming
- recognition algorithm
- segmentation algorithm
- upper and lower bounds
- theoretical analysis
- probability distribution
- dynamic programming
- cost function
- error tolerance
- polynomial time complexity
- lower bound
- preprocessing