On weak tractability of the Clenshaw-Curtis Smolyak algorithm.
Aicke HinrichsErich NovakMario UllrichPublished in: J. Approx. Theory (2014)
Keyphrases
- learning algorithm
- experimental evaluation
- cost function
- detection algorithm
- dynamic programming
- computationally efficient
- theoretical analysis
- computational cost
- times faster
- preprocessing
- computational complexity
- experimental study
- optimal solution
- memory requirements
- matching algorithm
- estimation algorithm
- optimization algorithm
- single pass
- high accuracy
- worst case
- probabilistic model
- significant improvement
- k means
- machine learning
- expectation maximization
- particle swarm optimization
- image compression
- segmentation algorithm
- neural network
- np hard
- constraint satisfaction
- convergence rate
- data structure