In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Various research papers question and analyze the maturity of the e-government research area and its stance as a scientific discipline. The common conclusion of these papers is the...