Sciweavers

2079 search results - page 321 / 416
» Universality of random graphs
Sort
View
ICALP
2010
Springer
15 years 6 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
SIROCCO
2008
15 years 5 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
PICS
2001
15 years 5 months ago
An Autosophy Image Content-Based Television System
A first television system based on the Autosophy information theory is now being tested. The new television marks a major theoretical break from conventional television based on t...
Klaus Holtz, Eric Holtz
CCS
2010
ACM
15 years 4 months ago
A new framework for efficient password-based authenticated key exchange
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
Adam Groce, Jonathan Katz
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 months ago
Security for Wiretap Networks via Rank-Metric Codes
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
Danilo Silva, Frank R. Kschischang