A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
Vincent Y. F. Tan, Sujay Sanghavi, John W. Fisher ...
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...