2314 search results - page 285 / 463 » Minimal Partitions of a Graph |
113
Voted
NIPS
2000
15 years 5 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
116
Voted
CLEIEJ
2008
15 years 4 months ago
2008
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide whi...
107
Voted
DISOPT
2008
15 years 4 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
112
click to vote
JCT
2008
15 years 4 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
106
click to vote
AML
2005
15 years 4 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...