We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
System administrators are unique computer users. As power users in complex and high-risk work environments, intuition tells us that they may have requirements of the tools they us...
Nicole F. Velasquez, Suzanne P. Weisband, Alexandr...
A formal model called CoAuto (Cooperative Automaton) is proposed ibe and analyze cooperative processes. A basic CoAuto abstracts the behaviors of a single active entity. It separat...
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...