5183 search results - page 888 / 1037 » The Complexity of Distributions |
167
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
189
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
184
click to vote
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
170
click to vote
STOC
2003
ACM
16 years 6 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...
181
click to vote
PODS
2005
ACM
16 years 6 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...