164 search results - page 10 / 33 » Balanced Interval Coloring |
88
Voted
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper proposes an extension to the mean shift tracking. We introduce the color connectedness degrees (CCD) which, more than providing statistical information about the target...
LCTRTS
2007
Springer
15 years 3 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
EJC
2007
14 years 9 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 ...
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...
CHI
2010
ACM
15 years 4 months ago
2010
ACM
Color is commonly used to represent categories and values in many computer applications, but differentiating these colors can be difficult in many situations (e.g., for users with...