ON SELECTING THE K LARGEST WITH RESTRICTED QUADRATIC QUERIES

被引:2
|
作者
GASARCH, WI
机构
[1] Department of Computer Science, Institute for Advanced Study, University of Maryland, College Park
基金
美国国家科学基金会;
关键词
THEORY OF COMPUTATION; CONCRETE COMPLEXITY;
D O I
10.1016/0020-0190(91)90099-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:193 / 195
页数:3
相关论文
共 50 条
  • [1] Selecting the k largest elements with parity tests
    Lam, TW
    Ting, HF
    [J]. ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 189 - 198
  • [2] Selecting the k largest elements with parity tests
    Lam, TW
    Ting, HF
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 101 (1-3) : 187 - 196
  • [3] ON SELECTING THE K-LARGEST WITH MEDIAN TESTS
    YAO, ACC
    [J]. ALGORITHMICA, 1989, 4 (02) : 293 - 300
  • [4] A SEQUENTIAL PROCEDURE FOR SELECTING LARGEST OF K MEANS
    ROBBINS, H
    SOBEL, M
    STARR, N
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (01): : 88 - &
  • [6] A restricted subset selection procedure for selecting the largest normal mean under heteroscedasticity
    Buzaianu, Elena M.
    Chen, Pinyuen
    Hsu, Lifang
    [J]. SEQUENTIAL ANALYSIS-DESIGN METHODS AND APPLICATIONS, 2023, 42 (01): : 56 - 69
  • [7] ON SELECTING LARGEST CATEGORY
    ALAM, K
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02): : 634 - &
  • [8] Efficient k-Nearest Neighbor Queries with the Signature Quadratic Form Distance
    Beecks, Christian
    Uysal, Merih Seran
    Seidl, Thomas
    [J]. 2010 IEEE 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDE 2010), 2010, : 10 - 15
  • [9] Compression for Quadratic Similarity Queries
    Ingber, Amir
    Courtade, Thomas
    Weissman, Tsachy
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) : 2729 - 2747
  • [10] SELECTING M POPULATIONS WITH LARGEST MEANS FROM K NORMAL POPULATIONS WITH UNKNOWN VARIANCES
    CHIU, WK
    [J]. AUSTRALIAN JOURNAL OF STATISTICS, 1974, 16 (03): : 144 - 147