Identifying frequent items in a network using gossip (Q666263): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60148589 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3546603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542551 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient top-K query calculation in distributed networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3546780 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geographic Gossip: Efficient Averaging for Sensor Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The shortest-path problem for graphs with random arc-lengths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding repeated elements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability and Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing separable functions via gossip / rank | |||
Normal rank |
Latest revision as of 00:03, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Identifying frequent items in a network using gossip |
scientific article |
Statements
Identifying frequent items in a network using gossip (English)
0 references
7 March 2012
0 references
gossip
0 references
frequent items
0 references
sketch
0 references