688 search results - page 4 / 138 » General Partitioning on Random Graphs |
COMBINATORICA
2002
13 years 7 months ago
2002
COMBINATORICA
2008
13 years 6 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
UAI
2004
13 years 8 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
CPC
2004
13 years 7 months ago
2004
AAAI
2007
13 years 9 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...