Suchergebnisse - binary tree encoding/decoding problem

  • Treffer 1 - 7 von 7
Treffer weiter einschränken
  1. 1

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

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 01.01.2025
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  2. 2

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

    ISSN: 1751-858X, 1751-8598
    Veröffentlicht: Stevenage John Wiley & Sons, Inc 01.03.2011
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  3. 3

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

    ISSN: 1525-3511
    Veröffentlicht: 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 …”
    Volltext
    Tagungsbericht
  4. 4

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

    Veröffentlicht: 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 …”
    Volltext
    Tagungsbericht
  5. 5

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.12.2009
    Veröffentlicht in arXiv.org (30.12.2009)
    “… These algorithms are asymmetric regarding encoding/decoding time and memory requirements, with the former being much more demanding …”
    Volltext
    Paper
  6. 6

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

    ISBN: 1109706766, 9781109706765
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2010
    “… The fundamental problem of communication is to transmit information reliably and efficiently through corrupted channels …”
    Volltext
    Dissertation
  7. 7

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

    ISSN: 1004-9541, 2210-321X
    Veröffentlicht: Elsevier B.V 01.09.2016
    Veröffentlicht in Chinese journal of chemical engineering (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 …”
    Volltext
    Journal Article