Sciweavers

504 search results - page 100 / 101
» Gossip-Based Computation of Aggregate Information
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ISSA
2004
13 years 7 months ago
Applying Similarities Between Immune Systems And Mobile Agent Systems In Intrusion Detection
Nearly all present-day commercial intrusion detection systems are based on a hierarchical architecture. Nodes at the bottom of the hierarchy collect information, which is passed t...
Marek Zielinski
ICFP
2010
ACM
13 years 7 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
SIGCOMM
2010
ACM
13 years 6 months ago
Contrabass: concurrent transmissions without coordination
A PHY and MAC protocol for MIMO concurrent transmissions, called Contrabass, is presented. Concurrent transmissions, also referred to as multi-user MIMO, are simultaneous transmis...
Sungro Yoon
WWW
2010
ACM
13 years 6 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...