CORR
2007
Springer
13 years 7 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 7 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 7 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 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
CORR
2007
Springer
13 years 7 months ago
2007
Springer