Sciweavers

1497 search results - page 298 / 300
» A Computational Model for Message Passing
Sort
View
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
14 years 8 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
SIGMOD
2009
ACM
153views Database» more  SIGMOD 2009»
14 years 8 months ago
ELMR: lightweight mobile health records
Cell phones are increasingly being used as common clients for a wide suite of distributed, database-centric healthcare applications in developing regions. This is particularly tru...
Arvind Kumar, Amey Purandare, Jay Chen, Arthur Mea...
INFOCOM
2008
IEEE
14 years 2 months ago
Live Baiting for Service-Level DoS Attackers
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...
Sherif M. Khattab, Sameh Gobriel, Rami G. Melhem, ...
CCS
2005
ACM
14 years 1 months ago
Preventing attribute information leakage in automated trust negotiation
Automated trust negotiation is an approach which establishes trust between strangers through the bilateral, iterative disclosure of digital credentials. Sensitive credentials are ...
Keith Irwin, Ting Yu
MIDDLEWARE
2004
Springer
14 years 1 months ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...