Sciweavers

1434 search results - page 44 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
NORDSEC
2009
Springer
14 years 2 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
ICML
2007
IEEE
14 years 8 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
GLOBECOM
2007
IEEE
14 years 1 months ago
Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink
Abstract— A distributed medium access control (MAC) algorithm for uplink OFDMA networks under the IEEE 802.16 framework is proposed and analyzed in this work. We present a simple...
Yu-Jung Chang, Feng-Tsun Chien, C. C. Jay Kuo