2957 search results - page 554 / 592 » The Complexity of Polynomial-Time Approximation |
STOC
2003
ACM
14 years 8 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...
PODS
2005
ACM
14 years 7 months 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...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...