A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
Herbert S. WilfPublished in: J. ACM (1978)
Keyphrases
- dynamic programming
- learning algorithm
- high accuracy
- matching algorithm
- computational cost
- experimental evaluation
- np hard
- improved algorithm
- computational complexity
- convex hull
- linear programming
- detection algorithm
- significant improvement
- convergence rate
- preprocessing
- optimal solution
- objective function
- times faster
- decision trees
- input data
- theoretical analysis
- camera calibration
- computationally intensive
- classification algorithm
- expectation maximization
- worst case
- least squares
- hidden markov models
- cost function
- multi objective