메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Local silencing rules for randomized gossip

Author keywords

[No Author keywords available]

Indexed keywords

IN-NETWORK PROCESSING; INITIAL CONDITIONS; MESSAGE COMPLEXITY; NETWORK TOPOLOGY; PRACTICAL IMPLEMENTATION; RANDOMIZED GOSSIP ALGORITHMS; SINGLE POINT;

EID: 80052455831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCOSS.2011.5982171     Document Type: Conference Paper
Times cited : (5)

References (23)
  • 2
    • 84940665979 scopus 로고    scopus 로고
    • Gossip along the way: Order-optimal consensus through randomized path averaging
    • Urbana-Champaign, IL, Sep.
    • F. Benezit, A. Dimakis, P. Thiran, and M. Vetterli. Gossip along the way: Order-optimal consensus through randomized path averaging. In Proc. Allerton Conf., Urbana-Champaign, IL, Sep. 2007.
    • (2007) Proc. Allerton Conf.
    • Benezit, F.1    Dimakis, A.2    Thiran, P.3    Vetterli, M.4
  • 3
    • 80052490098 scopus 로고    scopus 로고
    • The weighted coupon collector's problem and applications
    • Niagra Falls, Jul.
    • P. Berenbrink and T. Sauerwald. The weighted coupon collector's problem and applications. In Proc. COCOON, Niagra Falls, Jul. 2009.
    • (2009) Proc. COCOON
    • Berenbrink, P.1    Sauerwald, T.2
  • 7
    • 40749127156 scopus 로고    scopus 로고
    • Geographic gossip: Efficient averaging for sensor networks
    • Mar.
    • A. Dimakis, A. Sarwate, and M. Wainwright. Geographic gossip: Efficient averaging for sensor networks. IEEE Trans. Signal Processing, 56(3):1205-1216, Mar. 2008.
    • (2008) IEEE Trans. Signal Processing , vol.56 , Issue.3 , pp. 1205-1216
    • Dimakis, A.1    Sarwate, A.2    Wainwright, M.3
  • 10
    • 58649101118 scopus 로고    scopus 로고
    • Polynomial filtering for fast convergence in distributed consensus
    • Jan.
    • E. Kokiopoulou and P. Frossard. Polynomial filtering for fast convergence in distributed consensus. IEEE Trans. Signal Processing, 57(1):342-354, Jan. 2009.
    • (2009) IEEE Trans. Signal Processing , vol.57 , Issue.1 , pp. 342-354
    • Kokiopoulou, E.1    Frossard, P.2
  • 12
    • 80052491059 scopus 로고    scopus 로고
    • Location-aided distributed averaging algorithms
    • Urbana-Champaign, IL, Sep.
    • W. Li and H. Dai. Location-aided distributed averaging algorithms. In Proc. Allerton Conf., Urbana-Champaign, IL, Sep. 2007.
    • (2007) Proc. Allerton Conf.
    • Li, W.1    Dai, H.2
  • 14
    • 77951150356 scopus 로고    scopus 로고
    • Optimization and analysis of distributed averaging with short node memory
    • May
    • B. Oreshkin, M. Coates, and M. Rabbat. Optimization and analysis of distributed averaging with short node memory. IEEE Trans. Signal Processing, 58(5):2850-2865, May 2010.
    • (2010) IEEE Trans. Signal Processing , vol.58 , Issue.5 , pp. 2850-2865
    • Oreshkin, B.1    Coates, M.2    Rabbat, M.3
  • 16
    • 80052447269 scopus 로고    scopus 로고
    • Decentralized compression and predistribution via randomized gossiping
    • Nashville, TN, April
    • M. Rabbat, J. Haupt, A. Singh, and R. Nowak. Decentralized compression and predistribution via randomized gossiping. In Proc. ACM/IEEE IPSN, Nashville, TN, April 2006.
    • (2006) Proc. ACM/IEEE IPSN
    • Rabbat, M.1    Haupt, J.2    Singh, A.3    Nowak, R.4
  • 17
    • 33646801631 scopus 로고    scopus 로고
    • Robust decentralized source localization via averaging
    • Philadelphia, PA, March
    • M. Rabbat, R. Nowak, and J. Bucklew. Robust decentralized source localization via averaging. In Proc. IEEE ICASSP, Philadelphia, PA, March 2005.
    • (2005) Proc. IEEE ICASSP
    • Rabbat, M.1    Nowak, R.2    Bucklew, J.3
  • 18
    • 33750392429 scopus 로고    scopus 로고
    • Distributed detection in sensor networks with packet loss and finite capacity links
    • Nov.
    • V. Saligrama, M. Alanyali, and O. Savas. Distributed detection in sensor networks with packet loss and finite capacity links. IEEE Trans. Signal Processing, 54(11):4118-4132, Nov. 2006.
    • (2006) IEEE Trans. Signal Processing , vol.54 , Issue.11 , pp. 4118-4132
    • Saligrama, V.1    Alanyali, M.2    Savas, O.3
  • 19
    • 80052498296 scopus 로고    scopus 로고
    • Efficient in-network processing through information coalescence
    • San Francisco, Jun.
    • O. Savas, M. Alanyali, and V. Saligrama. Efficient in-network processing through information coalescence. In Proc. DCOSS, San Francisco, Jun. 2006.
    • (2006) Proc. DCOSS
    • Savas, O.1    Alanyali, M.2    Saligrama, V.3
  • 20
    • 35348916549 scopus 로고    scopus 로고
    • Distributed consensus and linear function calculation in networks: An observability perspective
    • Cambridge, MA, USA, Apr.
    • S. Sundaram and C. Hadjicostis. Distributed consensus and linear function calculation in networks: An observability perspective. In Proc. IEEE/ACM Int. Symp. Information Proc. in Sensor Networks, Cambridge, MA, USA, Apr. 2007.
    • (2007) Proc. IEEE/ACM Int. Symp. Information Proc. in Sensor Networks
    • Sundaram, S.1    Hadjicostis, C.2
  • 21
    • 84983675213 scopus 로고    scopus 로고
    • Fast decentralized averaging via multi-scale gossip
    • Santa Barbara, CA, Jun.
    • K. Tsianos and M. Rabbat. Fast decentralized averaging via multi-scale gossip. In Proc. IEEE DCOSS, Santa Barbara, CA, Jun. 2010.
    • (2010) Proc. IEEE DCOSS
    • Tsianos, K.1    Rabbat, M.2
  • 22
    • 0022783899 scopus 로고
    • Distributed asynchronous deterministic and stochastic gradient optimization algorithms
    • Sep.
    • J. Tsitsiklis, D. Bertsekas, and M. Athans. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Automatic Control, AC-31(9):803-812, Sep. 1986.
    • (1986) IEEE Trans. Automatic Control , vol.AC-31 , Issue.9 , pp. 803-812
    • Tsitsiklis, J.1    Bertsekas, D.2    Athans, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.