CORR
2007
Springer
13 years 11 months ago
2007
Springer
A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the s...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
— The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which ca...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2007
Springer
13 years 11 months ago
2007
Springer
An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. U...