263 search results - page 24 / 53 » Minimum Entropy Coloring |
SOFSEM
2010
Springer
15 years 6 months 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 ...
AAAI
1998
15 years 1 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
177
click to vote
Publication
Images with large areas of low texture pose significant challenge to stereo algorithms. We propose a novel segmentation based stereo scheme tuned to handle such scenes. We combine ...
112
click to vote
ESCAPE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
111
click to vote
TIT
2002
14 years 11 months ago
2002
We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We con...