Sciweavers

862 search results - page 106 / 173
» Random Information Spread in Networks
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
FC
2005
Springer
87views Cryptology» more  FC 2005»
15 years 5 months ago
Protecting Secret Data from Insider Attacks
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
David Dagon, Wenke Lee, Richard J. Lipton
NDSS
2009
IEEE
15 years 6 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
16 years 8 days ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
NETWORKING
2008
15 years 1 months ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...