1566 search results - page 166 / 314 » On a Cone Covering Problem |
126
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
118
click to vote
JGAA
2006
15 years 4 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
152
click to vote
TIT
2008
15 years 4 months ago
2008
We consider the problem of transmitting data at rate over a state-dependent channel with state information available at the sender and at the same time conveying the information ab...
140
click to vote
IJCGA
2000
15 years 4 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
142
click to vote
ORDER
2007
15 years 4 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...