4007 search results - page 542 / 802 » Computation with imprecise probabilities |
144
Voted
CIKM
1997
Springer
15 years 9 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
124
click to vote
RANDOM
1997
Springer
15 years 8 months ago
1997
Springer
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
137
click to vote
ISTCS
1993
Springer
15 years 8 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
161
Voted
PODC
1994
ACM
15 years 8 months ago
1994
ACM
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...
127
click to vote
DEBS
2010
ACM
15 years 8 months ago
2010
ACM
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...