Sciweavers

944 search results - page 7 / 189
» A Survey on Counting Networks
Sort
View
CCR
2008
94views more  CCR 2008»
14 years 11 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
99
Voted
AAAI
2006
15 years 1 months ago
Performing Incremental Bayesian Inference by Dynamic Model Counting
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
Wei Li 0002, Peter van Beek, Pascal Poupart
CP
2008
Springer
15 years 1 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
JAIR
2011
129views more  JAIR 2011»
14 years 6 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
MOBICOM
2006
ACM
15 years 5 months ago
Localization in underwater sensor networks: survey and challenges
In underwater sensor networks (UWSNs), determining the location of every sensor is important and the process of estimating the location of each node in a sensor network is known a...
Vijay R. Chandrasekhar, Winston Khoon Guan Seah, Y...