2310 search results - page 36 / 462 » Coloring Random Graphs |
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...
DM
2008
13 years 9 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
DIALM
2008
ACM
13 years 10 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
CRYPTO
2006
Springer
14 years 21 days ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...