Algorithm 861: Fortran 90 subroutines for computing the expansion coefficients of Mathieu functions using Blanch's algorithm.
Danilo ErricoloPublished in: ACM Trans. Math. Softw. (2006)
Keyphrases
- detection algorithm
- dynamic programming
- computational complexity
- learning algorithm
- high accuracy
- experimental evaluation
- cost function
- tree structure
- improved algorithm
- data sets
- times faster
- convergence rate
- estimation algorithm
- clustering method
- parallel implementation
- computationally efficient
- theoretical analysis
- similarity measure
- objective function
- computational cost
- np hard
- search space
- k means
- matching algorithm
- wavelet packet
- clustering algorithm
- selection algorithm
- recognition algorithm
- memory requirements
- linear combination
- classification algorithm
- ant colony optimization
- denoising
- segmentation algorithm
- linear programming
- particle swarm optimization