Sciweavers

230 search results - page 28 / 46
» A Random Bit Generator Using Chaotic Maps
Sort
View
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 6 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
SIGGRAPH
1995
ACM
15 years 5 months ago
Pyramid-based texture analysis/synthesis
This paper describes a method for synthesizing images that match the texture appearanceof a given digitized sample. This synthesisis completely automatic and requires only the “...
David J. Heeger, James R. Bergen
IJON
2007
120views more  IJON 2007»
15 years 2 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
ENGL
2007
180views more  ENGL 2007»
15 years 2 months ago
Biological Data Mining for Genomic Clustering Using Unsupervised Neural Learning
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...
Shreyas Sen, Seetharam Narasimhan, Amit Konar
DCC
2003
IEEE
16 years 1 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski