Sciweavers

3 search results - page 1 / 1
» Pseudorandom Number Generation: Impossibility and Compromise
Sort
View
JUCS
2006
114views more  JUCS 2006»
13 years 4 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 8 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
BMCBI
2008
116views more  BMCBI 2008»
13 years 4 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
Alvaro J. González, Li Liao