Sciweavers

5138 search results - page 253 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICASSP
2011
IEEE
14 years 10 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
INFOCOM
2012
IEEE
13 years 9 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
The Power of Simple Tabulation Hashing
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
Mihai Patrascu, Mikkel Thorup
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
16 years 1 days ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
BMCBI
2008
136views more  BMCBI 2008»
15 years 6 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...