Sciweavers

389 search results - page 15 / 78
» Computational Alternatives to Random Number Generators
Sort
View
IACR
2011
113views more  IACR 2011»
12 years 8 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
DMSN
2004
ACM
14 years 2 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
14 years 3 months ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...

Publication
189views
15 years 7 months ago
Packet Trains-Measurements and a New Model for Computer Network Traffic
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
R. Jain, S. Routhier
IPPS
2010
IEEE
13 years 6 months ago
pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
Sanchit Misra, Ramanathan Narayanan, Wei-keng Liao...