Sciweavers

26 search results - page 1 / 6
» Size of monochromatic components in local edge colorings
Sort
View
DM
2008
67views more  DM 2008»
13 years 5 months ago
Size of monochromatic components in local edge colorings
András Gyárfás, Gábor ...
ICDAR
2011
IEEE
12 years 4 months ago
A Chinese Character Localization Method Based on Intergrating Structure and CC-Clustering for Advertising Images
—In this paper, a novel Chinese character localization method is proposed for texts in advertising images. To deal with the texts with gradient color, a color clustering method b...
Jie Liu, Shuwu Zhang, Heping Li, Wei Liang
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
13 years 4 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...
COMBINATORICA
2010
13 years 2 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
IPAS
2007
13 years 7 months ago
Color filter array interpolation based on spatial adaptivity
Conventional approach in single-chip digital cameras is a use of color lter arrays (CFA) in order to sample di erent spectral components. Demosaicing algorithms interpolate these ...
Dmitriy Paliy, Radu Ciprian Bilcu, Vladimir Katkov...