513 search results - page 6 / 103 » Soft Edge Coloring |
122
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
121
click to vote
DSD
2003
IEEE
15 years 5 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
WSCG
2004
15 years 1 months ago
2004
The purpose of this paper is twofold: to propose two fast distribution functions for spotlights and to use terminology used in stage lighting to model these luminaries. In OpenGL ...
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
Knowing which edges in an image denote shadow edges and which are due to object boundaries or changes in surface reflectance has important applications in both computer vision and...
99
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Most of the current digital cameras feature a single sensor design which limits the number of channels recorded at each pixel location to one. However, a color image is represente...