An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
C. Andrew NeffJohn H. ReifPublished in: FOCS (1994)
Keyphrases
- experimental evaluation
- learning algorithm
- detection algorithm
- high accuracy
- k means
- single pass
- cost function
- computational complexity
- real world
- dynamic programming
- computationally efficient
- worst case
- improved algorithm
- convergence rate
- image processing
- simulated annealing
- linear programming
- complex systems
- data sets
- tree structure
- matching algorithm
- times faster
- recognition algorithm
- hardware implementation
- experimental study
- clustering method
- optimization algorithm
- semi supervised
- probabilistic model
- decision trees
- objective function
- active learning
- search algorithm
- preprocessing