K-tree: A height balanced tree structured vector quantizer

被引:0
|
作者
机构
[1] Geva, Shlomo
来源
Geva, Shlomo | 2000年 / IEEE, Piscataway, NJ, United States卷 / 01期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] K-tree:: A height balanced tree structured vector quantizer
    Geva, S
    NEURAL NETWORKS FOR SIGNAL PROCESSING X, VOLS 1 AND 2, PROCEEDINGS, 2000, : 271 - 280
  • [2] Finding a k-tree core and a k-tree center of a tree network in parallel
    Wang, BF
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (02) : 186 - 191
  • [3] Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network
    Wang, Y
    Wang, DQ
    Liu, W
    Tian, BY
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 553 - 562
  • [4] ALGORITHMS FOR A CORE AND K-TREE CORE OF A TREE
    PENG, ST
    STEPHENS, AB
    YESHA, Y
    JOURNAL OF ALGORITHMS, 1993, 15 (01) : 143 - 159
  • [5] On k-tree Containment Graphs of Paths in a Tree
    Liliana Alcón
    Noemí Gudiño
    Marisa Gutierrez
    Order, 2021, 38 : 229 - 244
  • [6] THE BANDWIDTH OF THE COMPLEMENT OF A K-TREE
    YUAN JINJIANG AND LIN YIXUN
    Applied Mathematics:A Journal of Chinese Universities, 1998, (04) : 91 - 94
  • [7] The extended k-tree algorithm
    Minder, Lorenz
    Sinclair, Alistair
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 586 - 595
  • [8] Document Clustering with K-tree
    De Vries, Christopher M.
    Geva, Shlomo
    ADVANCES IN FOCUSED RETRIEVAL, 2009, 5631 : 420 - 431
  • [9] The Extended k-tree Algorithm
    Minder, Lorenz
    Sinclair, Alistair
    JOURNAL OF CRYPTOLOGY, 2012, 25 (02) : 349 - 382
  • [10] ON THE SPANNING K-TREE PROBLEM
    CAI, LZ
    MAFFRAY, F
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 139 - 156