1749 search results - page 60 / 350 » Conditional colorings of graphs |
180
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for segmenting video frames into temporally stable colored regions, applying our technique to create artistic stylizations (e.g. cartoons and paintings)...
192
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
151
click to vote
PERCOM
2008
ACM
16 years 20 days ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
139
click to vote
DAM
2006
15 years 6 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...