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 improv
β¦ LIBER β¦
An efficient algorithm for sequential random sampling
β Scribed by Vitter, Jeffrey Scott
- Book ID
- 121220445
- Publisher
- Association for Computing Machinery
- Year
- 1987
- Tongue
- English
- Weight
- 764 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0098-3500
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An efficient algorithm for sequential ra
β
Vitter, Jeffrey Scott
π
Article
π
1987
π
Association for Computing Machinery
π
English
β 764 KB
An efficient parallel algorithm for rand
β
Vijayan Rajan; R.K. Ghosh; P. Gupta
π
Article
π
1989
π
Elsevier Science
π
English
β 403 KB
An efficient algorithm for generalized r
β
Amihood Amir; Doron Mintz
π
Article
π
1991
π
Elsevier Science
π
English
β 194 KB
An efficient sampling algorithm for vari
β
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
β
Hoon Chang; Jacob A. Abraham
π
Article
π
1994
π
Elsevier Science
β 345 KB
An Efficient Randomized Algorithm for De
β
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