A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets.
Mohab Safey El DinÉric SchostPublished in: J. ACM (2017)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- np hard
- times faster
- detection algorithm
- computational cost
- cost function
- globally optimal
- objective function
- convex hull
- closed form
- preprocessing
- data structure
- k means
- similarity measure
- learning algorithm
- neural network
- simulated annealing
- optimization algorithm
- optimal parameters
- optimal path
- matching algorithm
- multi objective
- search space
- computational complexity
- search algorithm
- image sequences
- information retrieval