Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm.
Anton LeykinJan VerscheldePublished in: Int. J. Comput. Sci. Eng. (2009)
Keyphrases
- optimal solution
- dynamic programming
- learning algorithm
- detection algorithm
- search strategy
- parallel implementation
- k means
- computational cost
- optimization algorithm
- theoretical analysis
- mathematical model
- significant improvement
- improved algorithm
- optimization method
- convex hull
- solution space
- solution quality
- segmentation algorithm
- particle swarm optimization
- high accuracy
- cost function
- search space
- objective function
- similarity measure
- linear systems
- recognition algorithm
- global solution
- times faster
- matching algorithm
- computationally efficient
- image segmentation
- clustering algorithm