A Padé-based algorithm for overcoming the Gibbs phenomenon.
Tobin A. DriscollBengt FornbergPublished in: Numer. Algorithms (2001)
Keyphrases
- learning algorithm
- experimental evaluation
- computational cost
- single pass
- search space
- k means
- dynamic programming
- optimization algorithm
- significant improvement
- objective function
- clustering method
- expectation maximization
- high accuracy
- worst case
- np hard
- cost function
- preprocessing
- similarity measure
- theoretical analysis
- optimal solution
- monte carlo
- times faster
- improved algorithm
- data sets
- probabilistic model
- particle swarm optimization
- computational complexity
- segmentation method
- selection algorithm
- multiscale