Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Background: High-throughput screening of pharmaceutical compound activity in tissue culture experiments requires time-consuming repeated analysis of the large amounts of data gene...