836 search results - page 52 / 168 » Orthogonal Colorings of Graphs |
125
click to vote
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a unique spectral modelling approach suitable for digital camera image processing. The proposed vector model combines both the magnitude and directional charac...
131
click to vote
ICIP
2010
IEEE
14 years 12 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)...
106
click to vote
PERCOM
2008
ACM
15 years 8 months 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...
102
click to vote
CORR
2010
Springer
15 years 2 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
DAM
2006
15 years 1 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...