9842 search results - page 1817 / 1969 » Problem complexity |
104
Voted
STOC
2003
ACM
16 years 1 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...
127
Voted
PODS
2005
ACM
16 years 27 days ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
107
click to vote
PODS
2008
ACM
16 years 27 days ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
128
click to vote
PODS
2008
ACM
16 years 27 days ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
118
click to vote
SIGCOMM
2009
ACM
15 years 7 months ago
2009
ACM
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...