A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set.
Gabriela JeronimoDaniel PerrucciPublished in: Discret. Comput. Geom. (2014)
Keyphrases
- dynamic programming
- segmentation algorithm
- significant improvement
- initial set
- objective function
- probabilistic model
- cost function
- learning algorithm
- convex hull
- tree structure
- linear programming
- probability function
- k means
- search space
- dual space
- np hard
- particle swarm optimization
- minimum length
- optimization algorithm
- computational complexity
- matching algorithm
- recognition algorithm
- score function
- input pattern
- polynomial time complexity
- spanning tree
- solution space
- posterior probability
- convergence rate
- detection algorithm
- computational cost
- preprocessing
- search algorithm
- feature selection