We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...