How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm.
Philippe LangloisNicolas LouvetPublished in: IEEE Symposium on Computer Arithmetic (2007)
Keyphrases
- experimental evaluation
- dynamic programming
- preprocessing
- matching algorithm
- computational complexity
- neural network
- improved algorithm
- input data
- computational cost
- significant improvement
- cost function
- single pass
- data sets
- learning algorithm
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- linear programming
- probabilistic model
- np hard
- k means
- high accuracy
- worst case
- decision trees
- data structure
- search space
- optimization algorithm
- detection algorithm
- evolutionary algorithm
- times faster
- memory requirements