Results 261 to 270 of about 239,050 (309)
Some of the next articles are maybe not open access.
The Journal of General Psychology, 1957
(1957). Colors and the Color-Blind. The Journal of General Psychology: Vol. 57, No. 2, pp. 229-240.
P R, HOFSTAETTER, D W, PRIMAC
openaire +2 more sources
(1957). Colors and the Color-Blind. The Journal of General Psychology: Vol. 57, No. 2, pp. 229-240.
P R, HOFSTAETTER, D W, PRIMAC
openaire +2 more sources
Cut-Colorings in Coloring Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prateek Bhakta +5 more
openaire +2 more sources
Coloring with three‐colored subgraphs
Journal of Graph Theory, 2003AbstractLet f(n) be the minimum number of colors required to color the edges of Kn,n such that every copy of K3,3 receives at least three colors on its edges. We prove that $$(0.62+o(1))\sqrt{n}< \, f(n)< \, (1+o(1))\sqrt{n}$$, where the upper bound is obtained by an explicit edge‐coloring.
openaire +1 more source
THE COLORING OF THE TREE OF COLORINGS
Advances and Applications in Discrete Mathematics, 2022Cherniavsky, Yonah, Jarden, Adi
openaire +2 more sources
Journal of the ACM, 1995
Summary: We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length \(k\), and other small subgraphs, within a given graph \(G= (V, E)\). The randomized algorithms obtained using this method can be derandomized using families of perfect hash functions.
Noga Alon, Raphael Yuster, Uri Zwick
openaire +3 more sources
Summary: We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length \(k\), and other small subgraphs, within a given graph \(G= (V, E)\). The randomized algorithms obtained using this method can be derandomized using families of perfect hash functions.
Noga Alon, Raphael Yuster, Uri Zwick
openaire +3 more sources
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
Objects can be recognized on the basis of their color alone by color indexing, a technique developed by Swain-Ballard (1991) which involves matching color-space histograms. Color indexing fails, however, when the incident illumination varies either spatially or spectrally.
Funt, B. V., Finlayson, G. D.
openaire +2 more sources
Objects can be recognized on the basis of their color alone by color indexing, a technique developed by Swain-Ballard (1991) which involves matching color-space histograms. Color indexing fails, however, when the incident illumination varies either spatially or spectrally.
Funt, B. V., Finlayson, G. D.
openaire +2 more sources
Entropy, color, and color rendering
Journal of the Optical Society of America A, 2012The Shannon entropy [Bell Syst. Tech J.27, 379 (1948)] of spectral distributions is applied to the problem of color rendering. With this novel approach, calculations for visual white entropy, spectral entropy, and color rendering are proposed, indices that are unreliant on the subjectivity inherent in reference spectra and color samples.
openaire +2 more sources
Color memory and color constancy
Journal of the Optical Society of America A, 1996Color constancy is the perceived stability of the color of objects despite changes in the light illuminating them. An object's color is considered constant if the current perceived color is judged to be in accord with the remembered one. Thus the accuracy and precision of color memory are fundamental to understanding this classic problem.
E W, Jin, S K, Shevell
openaire +2 more sources