Suchergebnisse - binary generating code

  1. 1

    Optimized feature space learning for generating efficient binary codes for image retrieval von Jose, Abin, Ottlik, Erik Stefan, Rohlfing, Christian, Ohm, Jens-Rainer

    ISSN: 0923-5965, 1879-2677
    Veröffentlicht: Amsterdam Elsevier B.V 01.01.2022
    Veröffentlicht in Signal processing. Image communication (01.01.2022)
    “… The classical approach of Linear Discriminant Analysis (LDA) is generally used for generating an optimized low-dimensional feature space for single-labeled images …”
    Volltext
    Journal Article
  2. 2

    On the computation of Seidel Laplacian eigenvalues for graph-based binary codes von Mesnager, Sihem, Raja, Rameez, Wagay, Samir Ahmad

    ISSN: 0012-365X, 1872-681X
    Veröffentlicht: Elsevier B.V 01.07.2024
    Veröffentlicht in Discrete mathematics (01.07.2024)
    “… …0sk1tk, where si and ti are positive integers with 1≤i≤k. This type of binary code is called a binary generating code of G …”
    Volltext
    Journal Article
  3. 3

    Generating a Binary Symmetric Channel for Wiretap Codes von Harrison, Willie K., Fernandes, Telmo, Gomes, Marco A. C., Vilela, Joao P.

    ISSN: 1556-6013, 1556-6021
    Veröffentlicht: New York IEEE 01.08.2019
    “… The results specify a general coding recipe for obtaining both secure and reliable communications over the Gaussian wiretap channel, and one specific set of concatenated codes is presented as a test …”
    Volltext
    Journal Article
  4. 4

    A Nonconventional Approach to Generating Efficient Binary Gray Code Sequences von Ahmad, A., Bait-Shiginah, F.

    ISSN: 0278-6648
    Veröffentlicht: IEEE 01.05.2012
    Veröffentlicht in IEEE potentials (01.05.2012)
    “… Because of the reflection property of the code, sometimes the term Gray code is used to refer to reflected binary codes …”
    Volltext
    Journal Article
  5. 5

    The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes von Shany, Yaron, Berman, Amit

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: IEEE 01.03.2025
    Veröffentlicht in IEEE transactions on information theory (01.03.2025)
    “… In a paper from 2015, Ding et al. (IEEE Trans. IT, May 2015) conjectured that for odd m, the minimum distance of the binary BCH code of length <inline-formula> <tex-math notation="LaTeX">2^{m}-1 </tex-math></inline-formula …”
    Volltext
    Journal Article
  6. 6

    PEG-Like Design of Binary QC-LDPC Codes Based on Detecting and Avoiding Generating Small Cycles von He, Xuan, Zhou, Liang, Du, Junyi

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York IEEE 01.05.2018
    Veröffentlicht in IEEE transactions on communications (01.05.2018)
    “… ), which is suitable for constructing both single- and multi-weighted (binary) QC low-density parity-check (LDPC …”
    Volltext
    Journal Article
  7. 7

    Deep Recurrent Quantization for Generating Sequential Binary Codes von Song, Jingkuan, Zhu, Xiaosu, Gao, Lianli, Xin-Shun Xu, Liu, Wu, Heng Tao Shen

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 05.12.2020
    Veröffentlicht in arXiv.org (05.12.2020)
    “… To address this issue, we propose a Deep Recurrent Quantization (DRQ) architecture which can generate sequential binary codes …”
    Volltext
    Paper
  8. 8

    Learning Discriminative Binary Codes for Large-scale Cross-modal Retrieval von Xu, Xing, Shen, Fumin, Yang, Yang, Shen, Heng Tao, Li, Xuelong

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Veröffentlicht: United States IEEE 01.05.2017
    Veröffentlicht in IEEE transactions on image processing (01.05.2017)
    “… The core problem of cross-modal hashing is how to learn compact binary codes that construct the underlying correlations between heterogeneous features from different modalities …”
    Volltext
    Journal Article
  9. 9

    Generating constant weight binary codes von Knight, DG

    ISSN: 0020-739X, 1464-5211
    Veröffentlicht: Taylor & Francis Group 01.01.2008
    “… The determination of bounds for A(n, d, w), the maximum possible number of binary vectors of length n, weight w, and pairwise Hamming distance no less than d, is a classic problem in coding theory …”
    Volltext
    Journal Article
  10. 10

    Generating Source Code From Binary Files

    Veröffentlicht: Washington, D.C Targeted News Service 31.01.2023
    Veröffentlicht in Targeted News Service (31.01.2023)
    Volltext
    Newsletter
  11. 11

    Fried Binary Embedding: From High-Dimensional Visual Features to High-Dimensional Binary Codes von Hong, Weixiang, Yuan, Junsong

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Veröffentlicht: United States IEEE 01.10.2018
    Veröffentlicht in IEEE transactions on image processing (01.10.2018)
    “… , and can achieve better results in various tasks such as approximate nearest neighbor search. Generating long binary codes involves large projection matrix and high-dimensional matrix-vector multiplication, thus is memory and compute intensive …”
    Volltext
    Journal Article
  12. 12

    Optimized Feature Space Learning for Generating Efficient Binary Codes for Image Retrieval von Abin Jose, Ottlik, Erik Stefan, Rohlfing, Christian, Jens-Rainer Ohm

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.01.2020
    Veröffentlicht in arXiv.org (30.01.2020)
    “… Classical approach of Linear Discriminant Analysis (LDA) is generally used for generating an optimized low dimensional feature space for single-labeled images …”
    Volltext
    Paper
  13. 13

    A parallel algorithm for generating chain code of objects in binary images von Chia, Tsorng-Lin, Wang, Kuang-Bor, Chen, Lay-Rong, Chen, Zen

    ISSN: 0020-0255, 1872-6291
    Veröffentlicht: Elsevier Inc 01.02.2003
    Veröffentlicht in Information sciences (01.02.2003)
    “… A parallel algorithm that contains the chain code generating rules and operations needed is also described, and the algorithm is mapped onto a one-dimensional systolic array containing ⌈ 1 2 (N+1 …”
    Volltext
    Journal Article
  14. 14

    Ultra-fast analog-to-digital converter based on a nonlinear triplexer and an optical coder with a photonic crystal structure von Mehdizadeh, Farhad, Soroosh, Mohammad, Alipour-Banaei, Hamed, Farshidi, Ebrahim

    ISSN: 2155-3165
    Veröffentlicht: United States 01.03.2017
    “… The nonlinear triplexer is for creating discrete levels in the continuous optical input signal, and the optical coder is for generating a 2-bit standard binary code out of the discrete levels coming …”
    Weitere Angaben
    Journal Article
  15. 15
  16. 16

    Generating Binary Optimal Codes Using Heterogeneous Parallel Computing von Paliwal, Srajan, Tiwary, Saurabh, Chaudhury, Bhaskar, Gupta, Manish K

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.07.2015
    Veröffentlicht in arXiv.org (20.07.2015)
    “… However generating codes with long lengths \(n\) using serial algorithms is computationally very expensive, for example the worst case time complexity of a Greedy algorithm is \(\mathcal{O}(n\; 4^n …”
    Volltext
    Paper
  17. 17

    Collective Affinity Learning for Partial Cross-Modal Hashing von Guo, Jun, Zhu, Wenwu

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Veröffentlicht: United States IEEE 01.01.2020
    Veröffentlicht in IEEE transactions on image processing (01.01.2020)
    “… To address this problem, we propose a novel Collective Affinity Learning Method (CALM), which collectively and adaptively learns an anchor graph for generating binary codes on partial multi-modal data …”
    Volltext
    Journal Article
  18. 18
  19. 19
  20. 20

    UniBin: Assembly semantic-enhanced binary vulnerability detection without disassembly von Liu, Li, Wang, Shen, Jiang, Xunzhi

    ISSN: 0020-0255
    Veröffentlicht: Elsevier Inc 01.02.2025
    Veröffentlicht in Information sciences (01.02.2025)
    “… Current vulnerability detection methods predominantly rely on binary code similarity comparisons, which involve disassembling to obtain assembly code or control flow graphs …”
    Volltext
    Journal Article