Sciweavers

580 search results - page 22 / 116
» Choosing a random peer
Sort
View
GLOBECOM
2008
IEEE
15 years 6 months ago
Throughput Analysis of Randomized Sleep Scheduling with Constrained Connectivity in Wireless Sensor Networks
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
Youngsang Kim, Changwoo Yang, Chun-Hung Liu
IM
2007
14 years 11 months ago
The Spectral Gap of a Random Subgraph of a Graph
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
Fan R. K. Chung, Paul Horn
ICC
2007
IEEE
101views Communications» more  ICC 2007»
15 years 6 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum
ICANN
2005
Springer
15 years 5 months ago
Can Dynamic Neural Filters Produce Pseudo-Random Sequences?
Abstract. Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large c...
Yishai M. Elyada, David Horn
CRYPTO
2004
Springer
138views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
Secure Identity Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
Dan Boneh, Xavier Boyen