Výsledky vyhledávání - "Sub-linear Algorithms"

  • Zobrazuji výsledky 1 - 5 z 5
Upřesnit hledání
  1. 1

    Group Testing with Blocks of Positives and Inhibitors Autor Bui, Thach V., Echizen, Isao, Kuribayashi, Minoru, Kojima, Tetsuya, Nguyen, Thuc D.

    ISSN: 1099-4300, 1099-4300
    Vydáno: Basel MDPI AG 30.10.2022
    Vydáno v Entropy (Basel, Switzerland) (30.10.2022)
    “…The main goal of group testing is to identify a small number of specific items among a large population of items. In this paper, we consider specific items as…”
    Získat plný text
    Journal Article
  2. 2

    On Performance of Sparse Fast Fourier Transform Algorithms Using the Flat Window Filter Autor Li, Bin, Jiang, Zhikang, Chen, Jie

    ISSN: 2169-3536, 2169-3536
    Vydáno: Piscataway IEEE 2020
    Vydáno v IEEE access (2020)
    “…The problem of computing the Sparse Fast Fourier Transform(sFFT) of a <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula>-sparse signal…”
    Získat plný text
    Journal Article
  3. 3

    Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms Autor Jiang, Zhikang, Chen, Jie, Li, Bin

    ISSN: 2169-3536, 2169-3536
    Vydáno: Piscataway IEEE 2021
    Vydáno v IEEE access (2021)
    “…Computing the Sparse Fast Fourier Transform(sFFT) has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling…”
    Získat plný text
    Journal Article
  4. 4

    On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter Autor Li, Bin, Jiang, Zhikang, Chen, Jie

    ISSN: 2079-9292, 2079-9292
    Vydáno: Basel MDPI AG 01.05.2021
    Vydáno v Electronics (Basel) (01.05.2021)
    “…Computing the sparse fast Fourier transform (sFFT) has emerged as a critical topic for a long time because of its high efficiency and wide practicability. More…”
    Získat plný text
    Journal Article
  5. 5

    Multi-resolution Hashing for Fast Pairwise Summations Autor Charikar, Moses, Siminelakis, Paris

    ISSN: 2575-8454
    Vydáno: IEEE 01.11.2019
    “…A basic computational primitive in the analysis of massive datasets is summing simple functions over a large number of objects. Modern applications pose an…”
    Získat plný text
    Konferenční příspěvek