A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets.
Mohab Safey El DinÉric SchostPublished in: CoRR (2013)
Keyphrases
- dynamic programming
- worst case
- detection algorithm
- optimal solution
- computational complexity
- preprocessing
- computational cost
- search space
- cost function
- optimization algorithm
- segmentation algorithm
- simulated annealing
- learning algorithm
- globally optimal
- times faster
- closed form
- neural network
- database queries
- exhaustive search
- database
- multi dimensional
- matching algorithm
- data sources
- np hard
- objective function
- decision trees