Efficient distributed algorithm to solve updating minimum spanning tree problem.
Jungho ParkKenichi HagiharaNobuki TokuraToshimitsu MasuzawaPublished in: Systems and Computers in Japan (1992)
Keyphrases
- single pass
- dynamic programming
- preprocessing
- learning algorithm
- cost function
- improved algorithm
- times faster
- computationally efficient
- k means
- experimental evaluation
- lightweight
- expectation maximization
- high accuracy
- computational complexity
- recognition algorithm
- convergence rate
- optimization algorithm
- worst case
- probabilistic model
- computational cost
- search space
- optimal solution
- cooperative
- linear programming
- image sequences
- theoretical analysis
- segmentation algorithm
- objective function
- query processing
- selection algorithm
- multi robot
- computationally intensive
- data sets