1749 search results - page 88 / 350 » Conditional colorings of graphs |
156
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
187
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
141
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
243
click to vote
DAS
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents the result of an adaptive region growing segmentation technique for color document images using an irregular pyramid structure. The emphasis is in the segmentat...