Sciweavers

242 search results - page 2 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
FPL
2006
Springer
147views Hardware» more  FPL 2006»
13 years 8 months ago
Non-Uniform Random Number Generation Through Piecewise Linear Approximations
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...
David B. Thomas, Wayne Luk
GLOBECOM
2007
IEEE
13 years 11 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
EUROPAR
2009
Springer
13 years 11 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICASSP
2011
IEEE
12 years 8 months ago
Compressive sampling with a successive approximation ADC architecture
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
Chenchi Luo, James H. McClellan
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