2310 search results - page 101 / 462 » Coloring Random Graphs |
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
CVPR
2012
IEEE
12 years 19 days ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
COMBINATORICS
2006
13 years 10 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
CPC
2011
13 years 5 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
ICCI
1991
14 years 1 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...