2514 search results - page 454 / 503 » On the Computation of Approximations of Database Queries |
129
Voted
STOC
2007
ACM
16 years 25 days 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...
107
Voted
AIPS
2008
15 years 2 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
105
Voted
ICDE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
201
click to vote
SASP
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
126
Voted
PODS
2005
ACM
16 years 20 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...