Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity.
Rémi PrébetMohab Safey El DinÉric SchostPublished in: CoRR (2024)
Keyphrases
- computational complexity
- times faster
- computational cost
- worst case
- improved algorithm
- detection algorithm
- space complexity
- k means
- expectation maximization
- experimental evaluation
- genetic algorithm
- dynamic programming
- cost function
- np hard
- linear complexity
- neural network
- estimation algorithm
- learning algorithm
- particle swarm optimization
- objective function
- high computational complexity
- memory requirements
- convex hull
- similarity measure
- energy function
- shortest path
- optimal solution
- input data
- linear programming
- high accuracy
- data structure
- probabilistic model
- significant improvement
- hidden markov models