513 search results - page 9 / 103 » Soft Edge Coloring |
101
Voted
ICIAR
2005
Springer
15 years 6 months ago
2005
Springer
In this paper a novel class of filters designed for the removal of impulsive noise in color images is presented. The proposed filter family is based on the kernel function which ...
83
Voted
JCT
2008
15 years 12 days 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...
99
Voted
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
125
Voted
SI3D
2009
ACM
15 years 7 months ago
2009
ACM
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...