Výsledky vyhľadávania - binary tree encoding/decoding problem

  • Zobrazené výsledky 1 - 7 z 7
Upresniť hľadanie
  1. 1

    Efficient encoding and decoding of voxelized models for machine learning-based applications Autor Strnad, Damjan, Kohek, Stefan, Zalik, Borut, Vasa, Libor, Nerat, Andrej

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 01.01.2025
    Vydané v IEEE access (01.01.2025)
    “… Storing, transmitting and consuming voxelized geometry, however, remains a challenging problem for machine learning pipelines running on devices with limited amount of on-chip memory with low access latency…”
    Získať plný text
    Journal Article
  2. 2

    Interferometric switch based all optical scheme for conversion of binary number to its quaternary-signed digit form Autor Chattopadhyay, T., Das, M.K., Roy, J.N., Chakraborty, A.K., Gayen, D.K.

    ISSN: 1751-858X, 1751-8598
    Vydavateľské údaje: Stevenage John Wiley & Sons, Inc 01.03.2011
    Vydané v IET circuits, devices & systems (01.03.2011)
    “… In arithmetical operation signed digit number is very essential for carry free computation. To achieve the parallelism in computation, a suitable number system and an efficient encoding/decoding scheme for handling the data are very much essential…”
    Získať plný text
    Journal Article
  3. 3

    An exact solution to degree distribution optimization in LT codes Autor Jafarizadeh, Saber, Jamalipour, Abbas

    ISSN: 1525-3511
    Vydavateľské údaje: IEEE 01.04.2014
    “… Based on AND-OR tree analysis of Belief Propagation (BP) algorithm, a new formulation of the problem in the form of standard semidefinite programming is presented…”
    Získať plný text
    Konferenčný príspevok..
  4. 4

    A Scalable Linear-Time Algorithm for Horizontal Visibility Graph Construction Over Long Sequences Autor Stephen, Colin

    Vydavateľské údaje: IEEE 15.12.2021
    “… data.The fastest scalable method for constructing HVGs today is the binary search tree (BST) encoding-decoding algorithm, which is O…”
    Získať plný text
    Konferenčný príspevok..
  5. 5

    Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays Autor Ferreira, Artur, Oliveira, Arlindo, Figueiredo, Mario

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 30.12.2009
    Vydané v arXiv.org (30.12.2009)
    “… These algorithms are asymmetric regarding encoding/decoding time and memory requirements, with the former being much more demanding…”
    Získať plný text
    Paper
  6. 6

    Joint channel coding and detection for efficient communication over fading channels Autor Peng, Ronghui

    ISBN: 1109706766, 9781109706765
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2010
    “…The fundamental problem of communication is to transmit information reliably and efficiently through corrupted channels…”
    Získať plný text
    Dissertation
  7. 7

    A formulation methodology for multicomponent distillation sequences based on stochastic optimization Autor Wang, Fei, Luo, Yiqing, Yuan, Xigang

    ISSN: 1004-9541, 2210-321X
    Vydavateľské údaje: Elsevier B.V 01.09.2016
    “… Theoretically, an array can represent any kind of split (non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding…”
    Získať plný text
    Journal Article