5785 search results - page 240 / 1157 » Approximability of Probability Distributions |
160
click to vote
DIS
2007
Springer
15 years 10 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
160
click to vote
ICS
2004
Tsinghua U.
15 years 9 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
120
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
122
click to vote
PODC
1999
ACM
15 years 8 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
202
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...