Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
We propose a novel approach to understanding
activities from their partial observations monitored through
multiple non-overlapping cameras separated by unknown time
gaps. In our...
Social applications on the web let users track and follow the activities of a large number of others regardless of location or affiliation. There is a potential for this transpare...
Laura A. Dabbish, H. Colleen Stuart, Jason Tsay, J...
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...