145 search results - page 17 / 29 » Strong Colorings of Hypergraphs |
76
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
101
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
JGTOOLS
2008
14 years 9 months ago
2008
A sensor located inside a digital camera is only able to measure the light which is reflected by an object. The reflected light varies with the spectral power distribution of the ...
89
Voted
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...