173 search results - page 17 / 35 » Every color chromakey |
COMBINATORICS
1999
14 years 11 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
RSA
2008
14 years 11 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
117
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
101
click to vote
MIRAGE
2009
Springer
15 years 6 months ago
2009
Springer
Flash light of digital cameras is a very useful way to picture scenes with low quality illumination. Nevertheless, especially low-end cameras integrated flash lights are considere...