2555 search results - page 355 / 511 » Quantifiers and Working Memory |
133
click to vote
STOC
2003
ACM
16 years 4 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...
130
click to vote
OSDI
2008
ACM
16 years 4 months ago
2008
ACM
While modern workloads are increasingly interactive and resource-intensive (e.g., graphical user interfaces, browsers, and multimedia players), current operating systems have not ...
211
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
149
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
141
Voted
MOBISYS
2004
ACM
16 years 3 months ago
2004
ACM
ZebraNet is a mobile, wireless sensor network in which nodes move throughout an environment working to gather and process information about their surroundings [10]. As in many sen...