1029 search results - page 52 / 206 » Probabilistic Recurrence Relations |
112
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
131
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
136
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
134
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
129
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...