Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...