We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
We propose a novel algorithm for temporal tracking of the fibrillatory frequency for Atrial Fibrillation (AF) ECG. Both Atrial activity extraction and fibrillatory frequency tra...
Sandun Kodituwakku, Rodney A. Kennedy, Thushara D....
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...