A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials.
Michael SagraloffPublished in: CoRR (2014)
Keyphrases
- dynamic programming
- detection algorithm
- learning algorithm
- objective function
- preprocessing
- optimal solution
- cost function
- matching algorithm
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- experimental evaluation
- k means
- computational cost
- worst case
- face recognition
- neural network
- search space
- high accuracy
- input data
- computational complexity
- clustering algorithm
- genetic algorithm
- tree structure