Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
Belief propagation (BP) is an increasingly popular method of performing approximate inference on arbitrary graphical models. At times, even further approximations are required, wh...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
A well-known method of estimating the length of a parametric curve in Rd is to sample some points from it and compute the length of the polygon passing through them. In this paper...
Michael S. Floater, Atgeirr F. Rasmussen, Ulrich R...