22 search results - page 4 / 5 » cpc 2010 |
CPC
2010
13 years 7 months ago
2010
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
CPC
2010
13 years 7 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
CPC
2010
13 years 10 months ago
2010
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
CPC
2010
13 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
PIMRC
2010
IEEE
13 years 7 months ago
2010
IEEE
In wireless scenarios an effective protocol to increase the reliability for time-varying channels is the hybrid automatic repeat request (H-ARQ). The H-ARQ scheme with cross-packet...