We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
Ana C. Casimiro, Susana Vinga, Ana T. Freitas, Arl...
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
High Angular Resolution Imaging (HARDI) can better explore the complex micro-structure of white matter compared to Diffusion Tensor Imaging (DTI). Orientation Distribution Functio...