5785 search results - page 177 / 1157 » Approximability of Probability Distributions |
115
click to vote
IJAR
2008
15 years 3 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
111
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
130
click to vote
IJAR
2010
15 years 2 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
165
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
119
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...