930 search results - page 51 / 186 » Color Differential Structure |
105
click to vote
JPDC
2008
15 years 2 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
109
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Kernel-based trackers aggregate image features within the support of a kernel (a mask) regardless of their spatial structure. These trackers spatially fit the kernel (usually in l...
131
click to vote
COR
2010
15 years 2 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
130
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
116
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper, we introduce the Skellam distribution as a sensor noise model for CCD or CMOS cameras. This is derived from the Poisson distribution of photons that determine the s...