111 search results - page 3 / 23 » Randomized computations on large data sets: tight lower boun... |
CINQ
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
IDEAS
2006
IEEE
13 years 11 months ago
2006
IEEE
Histograms are being used as non-parametric selectivity estimators for one-dimensional data. For highdimensional data it is common to either compute onedimensional histograms for ...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...