We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of ...
Anand K. Dhulipala, Christina Fragouli, Alon Orlit...
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...