The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...