AN EFFICIENT PARALLEL ALGORITHM FOR RANDOM SAMPLING

被引:9
|
作者
RAJAN, VY
GHOSH, RK
GUPTA, P
机构
关键词
D O I
10.1016/0020-0190(89)90206-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:265 / 268
页数:4
相关论文
共 50 条
  • [1] AN EFFICIENT ALGORITHM FOR GENERALIZED RANDOM SAMPLING
    AMIR, A
    MINTZ, D
    [J]. PATTERN RECOGNITION LETTERS, 1991, 12 (11) : 683 - 686
  • [2] AN EFFICIENT ALGORITHM FOR SEQUENTIAL RANDOM SAMPLING
    VITTER, JS
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1987, 13 (01): : 58 - 67
  • [3] FAST COMPUTATIONAL ALGORITHM IN PARALLEL RANDOM SAMPLING
    LO, KC
    PURVIS, A
    [J]. ELECTRONICS LETTERS, 1992, 28 (12) : 1115 - 1117
  • [4] AN EFFICIENT ALGORITHM FOR RANDOM SAMPLING WITHOUT REPLACEMENT
    GUPTA, P
    BHATTACHARJEE, GP
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1984, 16 (3-4) : 201 - 209
  • [5] AN EFFICIENT ALGORITHM FOR RANDOM SAMPLING WITHOUT REPLACEMENT
    GUPTA, P
    BHATTACHARJEE, GP
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 181 : 435 - 442
  • [6] Efficient Parallel Random Sampling-Vectorized, Cache-Efficient, and Online
    Sanders, Peter
    Lamm, Sebastian
    Huebschle-Schneider, Lorenz
    Schrade, Emanuel
    Dachsbacher, Carsten
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2018, 44 (03):
  • [7] Efficient and Reliable Clustering by Parallel Random Swap Algorithm
    Nigro, Libero
    Cicirelli, Franco
    Franti, Pasi
    [J]. 2022 IEEE/ACM 26TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED SIMULATION AND REAL TIME APPLICATIONS (DS-RT), 2022,
  • [8] A Hierarchical Random Graph Efficient Sampling Algorithm Based on Improved MCMC Algorithm
    Tie, Zhixin
    Zhu, Dingkai
    Hong, Shunhe
    Xu, Hui
    [J]. ELECTRONICS, 2022, 11 (15)
  • [9] Parallel Weighted Random Sampling
    Huebschle-Schneider, Lorenz
    Sanders, Peter
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [10] Parallel Streaming Random Sampling
    Tangwongsan, Kanat
    Tirthapura, Srikanta
    [J]. EURO-PAR 2019: PARALLEL PROCESSING, 2019, 11725 : 451 - 465