145 search results - page 10 / 29 » Strong Colorings of Hypergraphs |
STOC
2010
ACM
14 years 9 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
73
Voted
ISCAS
2003
IEEE
15 years 2 months ago
2003
IEEE
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...
52
Voted
COMBINATORICS
1999
14 years 9 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
SIAMDM
2008
14 years 9 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
94
Voted
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...