A Faster Algorithm for Asymptotic Communication for Omniscience.
Ni DingChung ChanQiaoqiao ZhouRodney A. KennedyParastoo SadeghiPublished in: CoRR (2016)
Keyphrases
- worst case
- experimental evaluation
- optimization algorithm
- significant improvement
- np hard
- dynamic programming
- theoretical analysis
- memory efficient
- learning algorithm
- single pass
- improved algorithm
- times faster
- computational cost
- k means
- high accuracy
- estimation algorithm
- optimal solution
- search space
- matching algorithm
- detection algorithm
- clustering method
- ant colony optimization
- path planning
- closed form
- segmentation algorithm
- recognition algorithm
- selection algorithm
- linear programming
- probabilistic model
- objective function
- similarity measure