Sciweavers

684 search results - page 95 / 137
» A characterization of b-perfect graphs
Sort
View
AAAI
2007
15 years 2 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
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 ...
Ole J. Mengshoel
NIPS
2007
15 years 1 months ago
Linear programming analysis of loopy belief propagation for weighted matching
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...
AAAI
2006
15 years 1 months ago
Improved Bounds for Computing Kemeny Rankings
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...
AAAI
2004
15 years 1 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
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 ...
Csaba Szepesvári
DGO
2009
139views Education» more  DGO 2009»
15 years 27 days ago
Citation analysis for e-government research
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...
Nusa Erman