Networked computing systems continue to grow in scale and in the complexity of their components and interactions. Component failures become norms instead of exceptions in these en...
We present a novel and accurate approximation for the distribution of the sum of equally correlated Nakagami-m variates. Ascertaining on this result we study the performance of Equ...
Zoran Hadzi-Velkov, Nikola Zlatanov, George K. Kar...
The blind recognition of communication parameters is a key research issue for commercial and military communication systems. The results of numerous investigations about symbol tim...
Vincent Choqueuse, Koffi Yao, Ludovic Collin, Gill...
In this study we rethought efficient market hypothesis from a viewpoint of complexity of market participants’ prediction methods and market price’s dynamics, and examined the ...
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...