A Faster Algorithm for Asymptotic Communication for Omniscience.
Ni DingChung ChanQiaoqiao ZhouRodney A. KennedyParastoo SadeghiPublished in: GLOBECOM Workshops (2016)
Keyphrases
- detection algorithm
- matching algorithm
- optimization algorithm
- computational cost
- improved algorithm
- times faster
- preprocessing
- expectation maximization
- objective function
- theoretical analysis
- particle swarm optimization
- linear programming
- high accuracy
- experimental evaluation
- np hard
- worst case
- memory efficient
- input data
- neural network
- segmentation algorithm
- multi robot
- selection algorithm
- k means
- classification algorithm
- highly efficient
- recognition algorithm
- communication networks
- computational complexity
- frequency domain
- cost function
- dynamic programming
- probabilistic model
- state space