TSMC
2002
13 years 4 months ago
2002
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
COMBINATORICS
1999
13 years 4 months ago
1999
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the ...
JCT
2008
13 years 4 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
STOC
1994
ACM
13 years 8 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
IROS
2006
IEEE
13 years 10 months ago
2006
IEEE
— Many approaches for extracting landmarks and objects from a camera image based on their color coding were published in the RoboCup domain. They are quite sophisticated and tune...
ROBOCUP
2007
Springer
13 years 10 months ago
2007
Springer
In this article we present an automatic on-line color calibration system that makes extensive use of the spatial relationships between color classes in the color space. First, we i...