5785 search results - page 208 / 1157 » Approximability of Probability Distributions |
158
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
139
click to vote
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
111
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
156
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
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...
139
click to vote
IPMU
2010
Springer
15 years 2 months ago
2010
Springer
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...