1302 search results - page 202 / 261 » On the Strong Chromatic Number |
142
click to vote
ECCC
2007
15 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
189
click to vote
TIP
2008
15 years 6 months ago
2008
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
177
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
188
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference ...
180
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...