20 search results - page 3 / 4 » Online Interval Coloring and Variants |
ISAAC
2005
Springer
14 years 18 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
MST
2010
13 years 5 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
TCS
2010
13 years 5 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...