CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider the nearest-neighbor simple random walk on Zd, d 2, driven by a field of bounded random conductances xy [0, 1]. The conductance law is i.i.d. subject to the condition...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The organization and mining of malaria genomic and post-genomic data is important to significantly increase the knowledge of the biology of its causative agents, and is motivated,...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
A constant-amplitude code is a code that reduces the peak-to-average power ratio (PAPR) in
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considere...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...