6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.AI2014
Logarithmic-Time Updates and Queries in Probabilistic Networks
Arthur L. Delcher, Adam J. Grove, Simon Kasif +1
In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In t…
cs.AI1996★ 6 cited
Logarithmic-Time Updates and Queries in Probabilistic Networks
A. L. Delcher, A. J. Grove, S. Kasif +1
Traditional databases commonly support efficient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take…