Probabilistic Analysis of an Election Algorithm in a Tree.
Yves MétivierNasser SahebPublished in: CAAP (1994)
Keyphrases
- dynamic programming
- preprocessing
- improved algorithm
- cost function
- learning algorithm
- k means
- linear programming
- em algorithm
- segmentation algorithm
- experimental evaluation
- significant improvement
- times faster
- computational complexity
- tree structure
- optimization algorithm
- graph structure
- minimum spanning tree
- binary tree
- particle swarm optimization
- high accuracy
- worst case
- np hard
- optimal solution
- context free parsing
- data sets
- similarity measure
- bayesian networks
- objective function
- recognition algorithm
- uncertain data
- search space
- special case
- clustering method
- detection algorithm
- computational cost
- bit rate
- generative model
- probabilistic model