530 search results - page 40 / 106 » Bounds on marginal probability distributions |
WAOA
2007
Springer
14 years 2 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...
MST
2011
13 years 2 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
SPAA
1992
ACM
14 years 12 hour ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
ICPP
1999
IEEE
14 years 7 days ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...