Sciweavers

1434 search results - page 41 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
NOSSDAV
2009
Springer
14 years 2 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
FOCS
1990
IEEE
13 years 11 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
FTDCS
2004
IEEE
13 years 11 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
ICDCN
2011
Springer
12 years 11 months ago
Scheduling Randomly-Deployed Heterogeneous Video Sensor Nodes for Reduced Intrusion Detection Time
This paper proposes to use video sensor nodes to provide an efficient intrusion detection system. We use a scheduling mechanism that takes into account the criticality of the surve...
Congduc Pham
ICDCS
2007
IEEE
14 years 1 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta