关注我们：

solidot新版网站常见问题，请点击这里查看。

Privacy Preserving Randomized Gossip Algorithms. (arXiv:1706.07636v1 [math.OC])

来源于:arXiv
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments. 查看全文>>