5889 search results - page 80 / 1178 » Graph Layout Problems |
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
WG
2010
Springer
13 years 8 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
AIPS
2007
14 years 10 days ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
JAIR
2008
13 years 10 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
IWOCA
2010
Springer
13 years 4 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...