5785 search results - page 188 / 1157 » Approximability of Probability Distributions |
145
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
136
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
124
click to vote
VOSS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
143
click to vote
UAI
1997
15 years 5 months ago
1997
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
150
click to vote
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...