✦ LIBER ✦

An efficient algorithm for sequential random sampling

✍ Scribed by Vitter, Jeffrey Scott

Book ID: 121220446
Publisher: Association for Computing Machinery
Year: 1987
Tongue: English
Weight: 764 KB
Volume: 13
Category: Article
ISSN: 0098-3500
DOI: 10.1145/23002.23003

No coin nor oath required. For personal study only.

✦ Synopsis

We examine several methods for drawing a sequential random sample of
n
records from a file containing
N
records. Method D is recommended for general use. The algorithm is on-line (so that CPU time can be overlapped with I/O), has a small constant memory requirement, and is easy to program. An improved implementation is detailed in the Appendix.

📜 SIMILAR VOLUMES

An efficient algorithm for sequential ra

An efficient algorithm for sequential random sampling

✍ Vitter, Jeffrey Scott 📂 Article 📅 1987 🏛 Association for Computing Machinery 🌐 English ⚖ 764 KB

An efficient parallel algorithm for rand

An efficient parallel algorithm for random sampling

✍ Vijayan Rajan; R.K. Ghosh; P. Gupta 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 403 KB

An efficient algorithm for generalized r

An efficient algorithm for generalized random sampling

✍ Amihood Amir; Doron Mintz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 194 KB

An efficient sampling algorithm for vari

An efficient sampling algorithm for variational Monte Carlo

✍ Scemama, Anthony; Lelièvre, Tony; Stoltz, Gabriel; Cancès, Eric; Caffarel, Mic 📂 Article 📅 2006 🏛 American Institute of Physics 🌐 English ⚖ 419 KB

An efficient critical path tracing algor

An efficient critical path tracing algorithm for sequential circuits

✍ Hoon Chang; Jacob A. Abraham 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 345 KB

An Efficient Randomized Algorithm for De

An Efficient Randomized Algorithm for Detecting Circles

✍ Teh-Chuan Chen; Kuo-Liang Chung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related paramete