An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network.
Thuy Lien PhamMarc BuiIvan LavalléeSi Hoàng DoPublished in: RIVF (2006)
Keyphrases
- computational complexity
- detection algorithm
- maximum flow
- dynamic programming
- optimization algorithm
- segmentation algorithm
- k means
- np hard
- camera network
- computer networks
- worst case
- simulated annealing
- peer to peer
- preprocessing
- optimal solution
- minimal cost
- probabilistic model
- push relabel
- learning algorithm
- computational cost
- significant improvement
- objective function
- bayesian networks