CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the problem of transmitting data at rate R over a state dependent channel p(ylx, s) with the state information available at the sender and at the same time conveying th...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...