LEADER 01064nam a2200277 i 4500 001 991000077049707536 005 20020509161756.0 008 010704s1973 it ||| | ita 035 $ab11307535-39ule_inst 035 $aPARLA201454$9ExL 040 $aDip.to Filosofia$bita 082 0 $a953 100 1 $aAbdel- Malek, Anouar$0119775 245 13$aLa rinascita del mondo arabo /$cA. Abdel-Malek ...[et al.] ; prefazione di Miriam Mafai 260 $aRoma :$bEditori riuniti,$c1973 300 $a232 p. ;$c19 cm. 490 0 $aArgomenti ;$v26 500 $aComunicazioni presentate a un seminario promosso dal Comitato per il Terzo mondo dell'Università di Lovanio nel 1970 650 4$aPaesi arabi$ySec. 20. 700 1 $aMafai, Miriam 907 $a.b11307535$b23-02-17$c01-07-02 912 $a991000077049707536 945 $aLE005IF XIX D 22$g1$i2005000267437$lle005$o-$pE0.00$q-$rl$s- $t0$u1$v1$w1$x0$y.i11476205$z01-07-02 996 $aRinascita del mondo arabo$9823270 997 $aUNISALENTO 998 $ale005$b01-01-01$cm$da $e-$fita$git $h3$i1 LEADER 02346oam 2200469zu 450 001 9910146778903321 005 20241212215316.0 010 $a9781509097708 010 $a1509097708 035 $a(CKB)1000000000022675 035 $a(SSID)ssj0000453788 035 $a(PQKBManifestationID)12128878 035 $a(PQKBTitleCode)TC0000453788 035 $a(PQKBWorkID)10481690 035 $a(PQKB)11337283 035 $a(NjHacI)991000000000022675 035 $a(EXLCZ)991000000000022675 100 $a20160829d2005 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 00$a2005 4th International Workshop on Information Processing in Sensor Networks 210 31$a[Place of publication not identified]$cI E E E$d2005 215 $a1 online resource 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780780392014 311 08$a0780392019 330 $aWe consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters. This scheme doesn't involve explicit point-to-point message passing or routing; instead, it diffuses information across the network by updating each node's data with a weighted average of its neighbors' data (they maintain the same data structure). At each step, every node can compute a local weighted least-squares estimate, which converges to the global maximum-likelihood solution. This scheme is robust to unreliable communication links. We show that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs are jointly connected. 606 $aInformation networks$vCongresses 606 $aMultisensor data fusion$vCongresses 606 $aSensor networks$vCongresses 615 0$aInformation networks 615 0$aMultisensor data fusion 615 0$aSensor networks 676 $a025.04 801 0$bPQKB 906 $aPROCEEDING 912 $a9910146778903321 996 $a2005 4th International Workshop on Information Processing in Sensor Networks$92511805 997 $aUNINA