82 search results - page 11 / 17 » A Lower Bound on Wait-Free Counting |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
JCT
2011
13 years 2 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
SIAMCOMP
2002
13 years 7 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...