Anytime approximation in probabilistic databases
This article describes an approximation algorithm for computing the probability of propositional formulas over discrete random variables. It incrementally refines lower and upper bounds on the probability of the formulas until the desired absolute or relative error guarantee is reached. This algorit...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
2013
|