106 search results - page 9 / 22 » Further Results on Swarms Solving Graph Coloring |
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
ICMCS
2009
IEEE
13 years 6 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...