Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
Javier Mateos, Rafael Molina, Aggelos K. Katsaggel...
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple loc...
Abstract—This paper develops an efficient distributed algorithm for localising motes in a large scale sensor network using radio interferometric positioning. The focus here is on...
Marcus Brazil, Mark R. Morelande, Bill Moran, D. A...