Eliminating extraneous edges in Greenberg's algorithm.
Martin E. DyerLes G. ProllPublished in: Math. Program. (1980)
Keyphrases
- times faster
- preprocessing
- experimental evaluation
- k means
- dynamic programming
- high accuracy
- computational complexity
- search space
- significant improvement
- cost function
- particle swarm optimization
- learning algorithm
- expectation maximization
- theoretical analysis
- optimization algorithm
- detection algorithm
- clustering method
- improved algorithm
- bayesian networks
- data sets
- level set
- worst case
- np hard
- segmentation algorithm
- data structure
- optimal solution
- classification algorithm
- path planning
- image processing
- recognition algorithm
- selection algorithm
- undirected graph