A near-optimal algorithm for computing real roots of sparse polynomials.
Michael SagraloffPublished in: ISSAC (2014)
Keyphrases
- computational complexity
- high accuracy
- experimental evaluation
- neural network
- learning algorithm
- dynamic programming
- objective function
- similarity measure
- detection algorithm
- optimization algorithm
- segmentation algorithm
- improved algorithm
- probabilistic model
- recognition algorithm
- theoretical analysis
- computationally efficient
- input data
- data sets
- times faster
- cost function
- k means
- classification algorithm
- tree structure
- image reconstruction
- theoretical guarantees
- clustering method
- expectation maximization
- worst case
- scheduling problem
- np hard
- face recognition
- image segmentation
- decision trees