Plantinga-Vegter Algorithm takes Average Polynomial Time.
Felipe CuckerAlperen Ali ErgürJosué Tonelli-CuetoPublished in: ISSAC (2019)
Keyphrases
- high accuracy
- detection algorithm
- computational complexity
- theoretical analysis
- learning algorithm
- cost function
- improved algorithm
- worst case
- optimization algorithm
- standard deviation
- preprocessing
- experimental evaluation
- search algorithm
- objective function
- recognition algorithm
- convergence rate
- times faster
- tree structure
- genetic algorithm
- particle swarm optimization
- computational cost
- dynamic programming
- np hard
- significant improvement
- k means
- data sets
- simulated annealing
- segmentation algorithm
- shortest path
- multi objective
- similarity measure
- path length
- graph isomorphism