745 search results - page 56 / 149 » On Generating Random Network Structures: Connected Graphs |
118
click to vote
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
116
Voted
GMAI
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper describes a method allowing the automatic multi-texturing and simulation of surface imperfections based on a cellular network. In this representation, networks of conne...
113
Voted
CP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
110
click to vote
JMLR
2006
15 years 15 days ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
106
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...