157 search results - page 16 / 32 » Online coloring of hypergraphs |
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
77
Voted
JCDL
2006
ACM
15 years 4 months ago
2006
ACM
We describe an HTML web page segmentation algorithm, which is applied to segment online medical journal articles (regular HTML and PDF-Converted-HTML files). The web page content ...
EJC
2007
14 years 10 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
ICIAP
1997
ACM
15 years 2 months ago
1997
ACM
The purpose is to arrive at recognition of multicolored objects invariant to a substantial change in viewpoint, object geometry and illumination. Assuming dichromatic reflectance...
91
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...