A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
In this paper, the issue of network topology control in wireless networks using a fully distributed algorithm is considered. Whereas the proposed distributed algorithm is designed...
Pau Closas, Alba Pages-Zamora, Juan A. Ferná...
Michael Hochman showed that every 1D effectively closed subshift can be simulated by a 3D subshift of finite type and asked whether the same can be done in 2D. It turned out that t...
Bruno Durand, Alexander Shen, Andrei E. Romashchen...
We analyze TCP-controlled bulk file transfers in a single station WLAN with nonzero propagation delay between the file server and the WLAN. Our approach is to model the flow of pac...