1208 search results - page 193 / 242 » On Counting Generalized Colorings |
IJISTA
2006
13 years 9 months ago
2006
In this paper a method for extraction of mid-level semantics from sign language videos is proposed, by employing high level domain knowledge. The semantics concern labeling of the ...
JCT
2008
13 years 9 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
JGT
2006
13 years 9 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...
EOR
2007
13 years 9 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
PAMI
2008
13 years 9 months ago
2008
We propose a novel adaptive technique for detecting moving shadows and distinguishing them from moving objects in video sequences. Most methods for detecting shadows work in a stat...