215 search results - page 15 / 43 » Online Bin Coloring |
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
The conventional histogram intersection (HI) algorithm computes the intersected section of the corresponding color histograms in order to measure the matching rate between two col...
108
Voted
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
111
click to vote
PR
2007
15 years 1 months ago
2007
In this paper, we propose a robust incremental learning framework for accurate skin region segmentation in real-life images. The proposed framework is able to automatically learn ...
108
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we present an interactive offline tracking system for generic color objects. The system achieves 60100 fps on a 320 ? 240 video. The user can therefore easily refin...
135
Voted
RSA
2011
14 years 8 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...