Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform upd...
Umut A. Acar, Alexander T. Ihler, Ramgopal R. Mett...
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
: A method for discovering multi-head attributional rules in large databases is presented and illustrated by results from an implemented program. Attributional rules (a.k.a. attrib...
We consider control systems of the type ˙x = Ax+α(t)bu, where u ∈ R, (A, b) is a controllable pair and α is an unknown time-varying signal with values in [0, 1] satisfying a ...