263 search results - page 35 / 53 » Minimum Entropy Coloring |
JCO
2011
14 years 6 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
116
click to vote
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Palette re-ordering is a well known and very effective approach for improving the compression of color indexed images. If the spatial distribution of the indexes in the image is s...
102
click to vote
VISUALIZATION
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we present a mesh compression method based on a multiresolution decomposition whose detail coefficients have a compact representation and thus smaller entropy than t...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...