368 search results - page 22 / 74 » Advanced Computing and Communications Research under NSF Sup... |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
This paper studies an active underground economy which specializes in the commoditization of activities such as credit card fraud, identity theft, spamming, phishing, online crede...
TIT
2008
13 years 7 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
Social networking applications have become very important web services that provide Internet-based platforms for their users to interact with their friends. With the advances in t...
RSA
1998
13 years 7 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...