130 search results - page 14 / 26 » Online Coloring Known Graphs |
SIROCCO
2000
14 years 11 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
87
Voted
JCO
2010
14 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
121
click to vote
SODA
2012
ACM
13 years 2 days ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
73
Voted
CVPR
1997
IEEE
15 years 1 months ago
1997
IEEE
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System , with an online user interface which is capable of identifying mult...
86
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...