We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...
In this work, we show that Kleinberg’s hubs and authorities model is closely related to both correspondence analysis, a well-known multivariate statistical technique, and a parti...
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...