120 search results - page 11 / 24 » Some New Ramsey Colorings |
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
People re-detection aims at performing re-identification of people who leave the scene and reappear after some time. This is an important problem especially in video surveillance ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
The problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. In this paper we propose a new alg...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
BMCBI
2007
13 years 7 months ago
2007
Background: Clustered Regularly Interspaced Palindromic Repeats (CRISPRs) are a novel type of direct repeat found in a wide range of bacteria and archaea. CRISPRs are beginning to...