3415 search results - page 355 / 683 » Lower bounds on kernelization |
148
click to vote
EOR
2008
15 years 6 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
202
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
168
click to vote
IJBRA
2006
15 years 6 months ago
2006
: Probabilistic models for biological sequences (DNA and proteins) are frequently used in bioinformatics. We describe statistical tests designed to detect the order of dependency a...
190
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading chan...
128
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We propose an information–theoretic approach to the watermark embedding and detection under limited detector resources. First, we present asymptotically optimal decision regions...