Sciweavers

196 search results - page 7 / 40
» PASS Approximation
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Structured variational methods for distributed inference in wireless ad hoc and sensor networks
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...
Yanbing Zhang, Huaiyu Dai
NIPS
2004
13 years 8 months ago
Message Errors in Belief Propagation
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...
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 27 days ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
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
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Approximate Frequency Counts over Data Streams
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...
Gurmeet Singh Manku, Rajeev Motwani
NA
2007
118views more  NA 2007»
13 years 7 months ago
Extrapolation methods for approximating arc length and surface area
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...