Randomness

Results: 1720



#Item
51Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2007-11-16 13:42:30
52HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e  Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

Add to Reading List

Source URL: www.hp-prime.de

Language: English - Date: 2014-09-09 06:12:34
53Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current Practice

Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current Practice

Add to Reading List

Source URL: iaoc.ietf.org

Language: English - Date: 2016-02-04 15:25:54
54Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:16
55Active Learning for Delineation of Curvilinear Structures Agata Mosinska-Domanska Raphael Sznitman  Pascal Fua

Active Learning for Delineation of Curvilinear Structures Agata Mosinska-Domanska Raphael Sznitman Pascal Fua

Add to Reading List

Source URL: womencourage.acm.org

Language: English - Date: 2016-08-09 09:14:04
56Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans†  David Zuckerman‡

Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2007-05-07 14:18:08
572 Complexity in the Universe Charles H. Bennett IBM Research Division, T . J. Watson Research Center Yorktown Heights, NYUSA.

2 Complexity in the Universe Charles H. Bennett IBM Research Division, T . J. Watson Research Center Yorktown Heights, NYUSA.

Add to Reading List

Source URL: cqi.inf.usi.ch

Language: English - Date: 2014-02-18 12:20:16
58Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡

Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2004-12-08 14:14:59
59Language is never, ever, ever, random ADAM KILGARRIFF Abstract Language users never choose words randomly, and language is essentially non-random. Statistical hypothesis testing uses a null hypothesis, which

Language is never, ever, ever, random ADAM KILGARRIFF Abstract Language users never choose words randomly, and language is essentially non-random. Statistical hypothesis testing uses a null hypothesis, which

Add to Reading List

Source URL: www.kilgarriff.co.uk

Language: English - Date: 2014-03-09 16:16:05
60Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time Ben Morris1  Phillip Rogaway2

Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time Ben Morris1 Phillip Rogaway2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-04-01 23:51:51