2924 search results - page 148 / 585 » Lower Bounds in Distributed Computing |
92
Voted
SPAA
1992
ACM
15 years 4 months 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...
ICONIP
2004
15 years 2 months ago
2004
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...
109
click to vote
JAIR
2011
14 years 3 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
95
Voted
AUSAI
2004
Springer
15 years 6 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
85
Voted
UAI
2004
15 years 2 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...