Identifying frequent items in a network using gossip (Q666263)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6012904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying frequent items in a network using gossip |
scientific article; zbMATH DE number 6012904 |
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
0.8906909823417664
0 references
0.7973041534423828
0 references
0.7843900322914124
0 references
0.7750111222267151
0 references
0.7724499702453613
0 references
