2944 search results - page 282 / 589 » Improving Bound Propagation |
190
click to vote
JCT
2010
15 years 5 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
197
click to vote
TCOM
2010
15 years 5 months ago
2010
In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit e...
180
click to vote
TRANSCI
2010
15 years 5 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
206
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
168
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...