Sciweavers

580 search results - page 2 / 116
» Choosing a random peer
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 5 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
MCS
2010
Springer
13 years 7 months ago
Choosing Parameters for Random Subspace Ensembles for fMRI Classification
Abstract. Functional magnetic resonance imaging (fMRI) is a noninvasive and powerful method for analysis of the operational mechanisms of the brain. fMRI classification poses a sev...
Ludmila I. Kuncheva, Catrin O. Plumpton
QEST
2009
IEEE
14 years 1 days ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
FOCS
2006
IEEE
13 years 11 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 1 days ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
Sérgio Crisóstomo, Udo Schilcher, Ch...