173 search results - page 24 / 35 » Every color chromakey |
DM
1998
14 years 11 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
108
click to vote
DM
1999
14 years 11 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
106
Voted
PRL
2007
14 years 11 months ago
2007
The bottleneck in interactive visual classification is the exchange of information between human and machine. We introduce the concept of the visible model, which is an ion of an ...
JCT
2010
14 years 10 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
107
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...