CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
It is now feasible to host basic web services on a smart phone due to the advances in wireless devices and mobile communication technologies. While the applications are quite welco...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages...