836 search results - page 111 / 168 » Orthogonal Colorings of Graphs |
119
click to vote
AAAI
2000
15 years 3 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
141
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
124
Voted
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
159
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
123
Voted
JGT
2008
15 years 1 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...