1208 search results - page 77 / 242 » On Counting Generalized Colorings |
109
click to vote
DCC
2007
IEEE
16 years 2 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
141
click to vote
AISS
2010
15 years 16 days ago
2010
This paper proposes an effective lane detection and tracking method using statistical modeling of lane color and edge-orientation in the image sequence. At first, we will address ...
146
click to vote
IWCMC
2009
ACM
15 years 7 months ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
136
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
129
click to vote
EJC
2008
15 years 3 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...