2944 search results - page 12 / 589 » Improving Bound Propagation |
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
In peer-to-peer networks, indices are used to map data to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes....
ECSQARU
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
NIPS
2008
13 years 9 months ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
CADE
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
ADHOCNOW
2004
Springer
14 years 27 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...