In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
— This paper describes a Model Order Reduction algorithm for multi-dimensional parameterized systems, based on a sampling procedure which incorporates a low order moment matching...
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...