<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hakan Terelius</style></author><author><style face="normal" font="default" size="100%">Damiano Varagnolo</style></author><author><style face="normal" font="default" size="100%">Carlos Baquero Moreno</style></author><author><style face="normal" font="default" size="100%">Karl Henrik Johansson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fast distributed estimation of empirical mass functions over anonymous networks</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE 52nd Annual Conference on Decision and Control (CDC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">December</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/cbm/files/cdc2013.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Firenze, Italy</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt; The aggregation and estimation of values over networks is fundamental for distributed applications, such as wireless sensor networks. Estimating the average, minimal and maximal values has already been extensively studied in the literature. In this paper, we focus on estimating empirical distributions of values in a network with anonymous agents. In particular, we compare two different estimation strategies in terms of their convergence speed, accuracy and communication costs. The first strategy is deterministic and based on the average consensus protocol, while the second strategy is probabilistic and based on the max consensus protocol.&lt;/p&gt;
</style></abstract></record></records></xml>