10293 search results - page 1816 / 2059 » Describing Semistructured Data |
171
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
191
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
Typical packet traffic in a sensor network reveals pronouncedpatterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, t...
163
click to vote
MOBISYS
2005
ACM
16 years 6 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
171
click to vote
EUROSYS
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we extensively tune and then compare the performance of web servers based on three different server architectures. The µserver utilizes an event-driven architectur...
186
click to vote
SOSP
2005
ACM
16 years 3 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...