776 search results - page 58 / 156 » Generalized Voxel Coloring |
145
click to vote
IWOCA
2009
Springer
15 years 10 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...
140
click to vote
EJC
2008
15 years 4 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...
142
click to vote
TIT
2010
14 years 10 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
115
click to vote
ENDM
2007
15 years 4 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
129
click to vote
DIAGRAMS
2004
Springer
15 years 9 months ago
2004
Springer
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...