316 search results - page 5 / 64 » On the Space Complexity of Randomized Synchronization |
108
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—We analyze the properties of a class of low complexity timing error detectors for the purpose of timing error tracking in orthogonal space-time block coding receivers. F...
116
Voted
PARMA
2004
15 years 1 months ago
2004
In the recent years, our ability of collecting information rapidly increases and huge databases that change over time in a high frequency have been developed. On the other hand, th...
98
Voted
ILP
2004
Springer
15 years 5 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
STOC
1996
ACM
15 years 4 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
101
click to vote
COMPLEX
2009
Springer
15 years 6 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...