Remark on algorithm 162: Near-minimax polynomial approximations and partitioning of intervals.
W. FraserJ. F. HartPublished in: Commun. ACM (1964)
Keyphrases
- times faster
- learning algorithm
- detection algorithm
- experimental evaluation
- preprocessing
- computational complexity
- k means
- dynamic programming
- high accuracy
- significant improvement
- np hard
- shortest path problem
- computational cost
- input data
- computationally tractable
- neural network
- space partitioning
- theoretical analysis
- computationally efficient
- worst case
- mobile robot
- objective function
- decision trees