263 search results - page 22 / 53 » Minimum Entropy Coloring |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
117
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
DM
2002
14 years 11 months ago
2002
We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q colors. Along the way we improve t...
ISBI
2004
IEEE
16 years 15 days ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
It was recently shown that the symmetric multiple-description (MD) quadratic rate-distortion function for memoryless Gaussian sources and two descriptions can be achieved by dithe...