Plantinga-Vegter algorithm takes average polynomial time.
Felipe CuckerAlperen Ali ErgürJosué Tonelli-CuetoPublished in: CoRR (2019)
Keyphrases
- dynamic programming
- preprocessing
- high accuracy
- detection algorithm
- cost function
- significant improvement
- improved algorithm
- computational complexity
- np hard
- learning algorithm
- expectation maximization
- worst case
- computational cost
- probabilistic model
- experimental evaluation
- k means
- theoretical analysis
- neural network
- simulated annealing
- linear programming
- input data
- segmentation algorithm
- objective function
- matching algorithm
- space complexity
- max flow
- polynomial time approximation