UPPER ERROR BOUND OF A NEW NEAR-OPTIMAL CODE

被引:0
|
作者
BUDA, RD
机构
[1] MCMASTER UNIV, HAMILTON, ONTARIO, CANADA
[2] CANADIAN GEN ELECT CO LTD, TORONTO, ONTARIO, CANADA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:441 / 445
页数:5
相关论文
共 50 条
  • [41] A NEW UPPER BOUND FOR ERROR-CORRECTING CODES
    JOHNSON, SM
    IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (03): : 203 - 207
  • [42] NEAR-OPTIMAL SPECTRAL FILTERING AND ERROR ESTIMATION FOR SOLVING ILL-POSED PROBLEMS
    Taroudaki, Viktoria
    O'Leary, Dianne P.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (06): : A2947 - A2968
  • [43] Near-Optimal Weighted Matrix Completion
    Lopez, Oscar
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [44] Near-Optimal Distributed Tree Embedding
    Ghaffari, Mohsen
    Lenzen, Christoph
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 197 - 211
  • [45] Near-Optimal Separators in String Graphs
    Matousek, Jiri
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (01): : 135 - 139
  • [46] Safe Learning for Near-Optimal Scheduling
    Busatto-Gaston, Damien
    Chakraborty, Debraj
    Guha, Shibashis
    Perez, Guillermo A.
    Raskin, Jean-Francois
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2021), 2021, 12846 : 235 - 254
  • [47] Statistically Near-Optimal Hypothesis Selection
    Bousquet, Olivier
    Braverman, Mark
    Kol, Gillat
    Efremenko, Klim
    Moran, Shay
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 909 - 919
  • [48] Near-Optimal (Euclidean) Metric Compression
    Indyk, Piotr
    Wagner, Tal
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 710 - 723
  • [49] NEAR-OPTIMAL BOUNDS FOR PHASE SYNCHRONIZATION
    Zhong, Yiqiao
    Boumal, Nicolas
    SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (02) : 989 - 1016
  • [50] Analysis of Near-Optimal Evacuation Instructions
    Huibregtse, Olga L.
    Bliemer, Michiel C. J.
    Hoogendoorn, Serge P.
    1ST CONFERENCE ON EVACUATION MODELING AND MANAGEMENT, 2010, 3 : 189 - 203