173 search results - page 25 / 35 » Every color chromakey |
123
click to vote
DM
2011
14 years 6 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
TSP
2010
14 years 6 months ago
2010
In this paper, we propose an approach to the transient and steady-state analysis of the affine combination of one fast and one slow adaptive filters. The theoretical models are bas...
ICPR
2004
IEEE
16 years 26 days ago
2004
IEEE
We propose a method for extracting a gaze region from an observed image by analyzing human's view directions and image information. The view direction of the user, which is r...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
JGT
2006
14 years 11 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...