On the Complexity of the Plantinga-Vegter Algorithm.
Felipe CuckerAlperen Ali ErgürJosué Tonelli-CuetoPublished in: CoRR (2020)
Keyphrases
- space complexity
- computational cost
- worst case
- experimental evaluation
- detection algorithm
- preprocessing
- cost function
- optimization algorithm
- segmentation algorithm
- matching algorithm
- k means
- computational complexity
- significant improvement
- np hard
- dynamic programming
- single pass
- learning algorithm
- high accuracy
- theoretical analysis
- recognition algorithm
- estimation algorithm
- data sets
- linear complexity
- lower bound
- neural network
- upper bound
- experimental study
- ant colony optimization
- scheduling problem
- decision problems
- times faster
- memory requirements
- search space
- improved algorithm
- optimal solution
- objective function