The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
In this paper, we propose a new re-coloring algorithm to enhance the accessibility for the color vision deficient (or colorblind). Compared to people with normal color vision, peop...
Jia-Bin Huang, Chu-Song Chen, Tzu-Cheng Jen, and S...
Color values in an image are related to image irradiance by a nonlinear function called radiometric response function. Since this function depends on the aperture and the shutter ...
Bad weather, such as fog and haze, can significantly degrade the visibility of a scene. Optically, this is due to the substantial presence of particles in the atmosphere that abso...