نتایج جستجو برای: gossip learning

تعداد نتایج: 602306  

2017
Frank Veltman

This thesis gives a formal logical analysis of a social phenomenon; gossip. Gossip can be used to serve many goals. The Sherlock Holmes’ of our society -always looking for an explanationmight use gossip to find an explanation for a surprising observation. Also for the agents that are not so eager to find the truth, for those who are more concerned about their social position instead, gossip mig...

Journal: :ITA 1994
Juraj Hromkovic Ralf Klasing Walter Unger Hubert Wagener Dana Pardubská

A concept of systolic dissemination of information in interconnection networks is presented, and the complexity of systolic gossip and broadcast in one-way (telegraph) and two-way (telephone) communication mode is investigated. The following main results are established: (i) a general relation between systolic broadcast and systolic gossip, (ii) optimal systolic gossip algorithms on paths in bo...

2016
Danilo Pianini Jacob Beal Mirko Viroli

Gossip protocols are a fast and effective strategy for computing a wide class of aggregate functions involving coordination of large sets of nodes. The monotonic nature of gossip protocols, however, mean that they can typically only adjust their estimate in one direction unless restarted, which disrupts the values being returned. We propose to improve the dynamical performance of gossip by runn...

2014
Dana Turcotte DANA TURCOTTE

of the Dissertation Gossip and the Group: A Self-Categorization Perspective by Dana Turcotte Claremont Graduate University: 2012 Gossip is a little studied topic and even fewer studies have examined gossip from the perspective of social identity and self categorization theories. However, many of the functions of gossip have significant implications for group processes, including bonding, norm t...

Journal: :J. UCS 2005
Ravi Sankar Veerubhotla Ashutosh Saxena Ved Prakash Gulati Arun K. Pujari

This work presents two new construction techniques for q-ary Gossip codes from tdesigns and Traceability schemes. These Gossip codes achieve the shortest code length specified in terms of code parameters and can withstand erasures in digital fingerprinting applications. This work presents the construction of embedded Gossip codes for extending an existing Gossip code into a bigger code. It disc...

2018
Boróka Pápay Bálint Kubik Júlia Galántai

Gossip is one of the most widespread human activities with multiple functions such as enhancing human cooperation, establishing social order, information sharing, norm enhancing or stress reduction. Gossip has been analyzed mostly by qualitative or survey methods. In this paper, we describe a quantitative approach to identify gossip in a large corpus containing spontaneous talk with LDA topic m...

2010
Jenny Brusk Ron Artstein David R. Traum

The purpose of this study is to get a working definition that matches people’s intuitive notion of gossip and is sufficiently precise for computational implementation. We conducted two experiments investigating what type of conversations people intuitively understand and interpret as gossip, and whether they could identify three proposed constituents of gossip conversations: third person focus,...

2012
Haluk O. Bingol

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

2012
Haluk O. Bingol

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

2016
Robbert van Renesse

A blockchain is an append-only sequence of blocks of arbitrary data. The two most popular approaches to blockchains are permissionless blockchains based on Proof of Work (PoW) and permissioned blockchains based on Byzantine consensus or Byzantine Fault Tolerance (BFT). The first is based on competitions between anonymous participants solving cryptopuzzles, while the latter is a cooperative appr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید