263 search results - page 14 / 53 » Minimum Entropy Coloring |
101
click to vote
NIPS
2001
15 years 1 months ago
2001
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
129
click to vote
APVIS
2011
13 years 11 months ago
2011
Visualization of flow fields with geometric primitives is often challenging due to occlusion that is inevitably introduced by 3D streamlines. In this paper, we present a novel v...
ICIP
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a Bayesian Network model for ContentBased Image Retrieval (CBIR). In the explanation and test of this work, only two images features (semantic evidences) are i...
107
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
CC
2006
Springer
14 years 12 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...