Sciweavers

1749 search results - page 16 / 350
» Conditional colorings of graphs
Sort
View
STOC
2006
ACM
95views Algorithms» more  STOC 2006»
16 years 5 months ago
Conditional hardness for approximate coloring
Irit Dinur, Elchanan Mossel, Oded Regev
ISCAS
2003
IEEE
115views Hardware» more  ISCAS 2003»
15 years 10 months ago
An efficient color compensation scheme for skin color segmentation
Skin color is a useful means for human face detection. In this paper, we propose an efficient color compensation method for skin color segmentation under varying lighting conditio...
Kwok-Wai Wong, Kin-Man Lam, Wan-Chi Siu
124
Voted
RSA
2006
88views more  RSA 2006»
15 years 4 months ago
Randomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 5 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
ASP
2003
Springer
15 years 10 months ago
Graphs and colorings for answer set programming: Abridged Report
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Kathrin Konczak, Torsten Schaub, Thomas Linke