A bound for the error term in the Brent-McMillan algorithm.
Richard P. BrentFredrik JohanssonPublished in: Math. Comput. (2015)
Keyphrases
- error bounds
- dynamic programming
- worst case
- experimental evaluation
- computationally efficient
- k means
- learning algorithm
- computational cost
- cost function
- theoretical analysis
- optimization algorithm
- clustering method
- recognition algorithm
- improved algorithm
- estimation error
- neural network
- linear complexity
- np hard
- similarity measure
- error function
- prediction error
- optimal solution
- computational complexity
- times faster
- ant colony optimization
- preprocessing
- detection algorithm
- search space
- evolutionary algorithm
- significant improvement
- simulated annealing
- probabilistic model
- segmentation algorithm
- error rate
- tree structure
- expectation maximization
- convergence rate
- data structure
- particle swarm optimization
- linear programming
- objective function