<--- Back to Details
First PageDocument Content
Analysis of algorithms / Randomized algorithm / Big O notation / Time complexity / Expectation–maximization algorithm / Pseudo-random number sampling / Theoretical computer science / Mathematics / Applied mathematics
Date: 2005-10-15 23:23:14
Analysis of algorithms
Randomized algorithm
Big O notation
Time complexity
Expectation–maximization algorithm
Pseudo-random number sampling
Theoretical computer science
Mathematics
Applied mathematics

Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown

Add to Reading List

Source URL: www.mathcs.emory.edu

Download Document from Source Website

File Size: 1,44 MB

Share Document on Facebook

Similar Documents

Fall 2008: EE360C Algorithms Description This course aims to study combinatorial algorithms. We will begin by reviewing discrete mathematics. We will then study measuring program performance using the big-O notation. Fol

Fall 2008: EE360C Algorithms Description This course aims to study combinatorial algorithms. We will begin by reviewing discrete mathematics. We will then study measuring program performance using the big-O notation. Fol

DocID: 1uFCO - View Document

American Concrete Institute (ACI) Journal Documentation Style Introduction This document is intended as a resource for students instructed to complete coursework according to ACI style guidelines. It is based on informat

American Concrete Institute (ACI) Journal Documentation Style Introduction This document is intended as a resource for students instructed to complete coursework according to ACI style guidelines. It is based on informat

DocID: 1rsKn - View Document

Optimal Staged Self-Assembly of General Shapes∗ Cameron Chalk1 , Eric Martinez1 , Robert Schweller1 , Luis Vega1 , Andrew Winslow2 , and Tim Wylie1 1  Department of Computer Science

Optimal Staged Self-Assembly of General Shapes∗ Cameron Chalk1 , Eric Martinez1 , Robert Schweller1 , Luis Vega1 , Andrew Winslow2 , and Tim Wylie1 1 Department of Computer Science

DocID: 1rsAT - View Document

The Practical Use of the Bemer Method for Exponentials Update Version: September 5, 2006 Ron Doerfler (http://www.myreckonings.com) In Chapter 4 of my book, Dead Reckoning: Calculating Without Instruments, a method is gi

The Practical Use of the Bemer Method for Exponentials Update Version: September 5, 2006 Ron Doerfler (http://www.myreckonings.com) In Chapter 4 of my book, Dead Reckoning: Calculating Without Instruments, a method is gi

DocID: 1rrb5 - View Document

JMLR: Workshop and Conference Proceedings vol 40:1–18, 2015  Learning the dependence structure of rare events: a non-asymptotic study Nicolas Goix Anne Sabourin

JMLR: Workshop and Conference Proceedings vol 40:1–18, 2015 Learning the dependence structure of rare events: a non-asymptotic study Nicolas Goix Anne Sabourin

DocID: 1rocp - View Document