Sciweavers

12659 search results - page 190 / 2532
» The distributed breakout algorithms
Sort
View
DC
2008
15 years 4 months ago
Approximate distributed top- k queries
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 ...
Boaz Patt-Shamir, Allon Shafrir
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 11 months ago
Distributed Link Scheduling for TDMA Mesh Networks
— 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...
Petar Djukic, Shahrokh Valaee
ICS
2010
Tsinghua U.
16 years 2 months ago
Distribution-Specific Agnostic Boosting
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...
Vitaly Feldman
ICASSP
2011
IEEE
14 years 8 months ago
Time-frequency analysis compensating missing data for Atrial Fibrillation ECG assessment
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....
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
15 years 8 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
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 ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao