52 search results - page 5 / 11 » On the computational complexity of strong edge coloring |
ALGOSENSORS
2009
Springer
14 years 18 days ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
CVPR
2008
IEEE
13 years 6 months ago
2008
IEEE
This paper presents a new image denoising model for real color photo noise removal. Our model is implemented in the hue, saturation and intensity (HSI) space. The hue and saturati...
ICPR
2004
IEEE
14 years 7 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
SOFSEM
2010
Springer
14 years 25 days ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
AMDO
2004
Springer
13 years 11 months ago
2004
Springer
Particle filter is a powerful algorithm to deal with non-linear and non-Gaussian tracking problems. However the algorithm relying only upon one image cue often fails in challengin...