836 search results - page 118 / 168 » Orthogonal Colorings of Graphs |
120
click to vote
DM
2006
15 years 1 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
113
Voted
ICMCS
2009
IEEE
14 years 11 months ago
2009
IEEE
We proposed a new foreground detection method using the static cameras. It merges multi-modality into graph cut energy function, and performs much better results than conventional...
131
Voted
ICIP
2007
IEEE
16 years 3 months ago
2007
IEEE
This paper describes a method for articulated upper body tracking in monocular scenes. The compatibility between model and the image is estimated using one particle filter for eac...
117
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
116
click to vote
CRIWG
2007
15 years 3 months ago
2007
Abstract. This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation an...