1015 search results - page 10 / 203 » An efficient algorithm for AS path inferring |
NIPS
2008
13 years 9 months ago
2008
Sampling functions in Gaussian process (GP) models is challenging because of the highly correlated posterior distribution. We describe an efficient Markov chain Monte Carlo algori...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
UAI
2008
13 years 9 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
AAAI
2010
13 years 9 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...