Výsledky vyhledávání - "Theory of computation → Graph algorithms analysis"

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

    NeuraChip: Accelerating GNN Computations with a Hash-based Decoupled Spatial Accelerator Autor Shivdikar, Kaustubh, Agostini, Nicolas Bohm, Jayaweera, Malith, Jonatan, Gilbert, Abellan, Jose L., Joshi, Ajay, Kim, John, Kaeli, David

    Vydáno: IEEE 29.06.2024
    “…Graph Neural Networks (GNNs) are emerging as a formidable tool for processing non-euclidean data across various domains, ranging from social network analysis…”
    Získat plný text
    Konferenční příspěvek
  2. 2

    Grundy Coloring and Friends, Half-Graphs, Bicliques Autor Aboulker, Pierre, Bonnet, Édouard, Kim, Eun Jung, Sikora, Florian

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 01.01.2023
    Vydáno v Algorithmica (01.01.2023)
    “…The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order σ , the smallest available color. The problem Grundy Coloring…”
    Získat plný text
    Journal Article
  3. 3

    Dispersing Obnoxious Facilities on a Graph Autor Grigoriev, Alexander, Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J.

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 01.06.2021
    Vydáno v Algorithmica (01.06.2021)
    “…We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of…”
    Získat plný text
    Journal Article
  4. 4

    RAmbler: de novo genome assembly of complex repetitive regions Autor Chakravarty, Sakshar, Logsdon, Glennis, Lonardi, Stefano

    ISSN: 2692-8205
    Vydáno: Cold Spring Harbor Laboratory 14.08.2023
    Vydáno v bioRxiv (14.08.2023)
    “…Complex repetitive regions (also called segmental duplications) in eukaryotic genomes often contain essential functional and regulatory information. Despite…”
    Získat plný text
    Paper
  5. 5

    Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time Autor Schmidt, Sebastian, Alanko, Jarno N

    ISSN: 2692-8205, 2692-8205
    Vydáno: Cold Spring Harbor Cold Spring Harbor Laboratory Press 20.05.2022
    Vydáno v bioRxiv (20.05.2022)
    “…A fundamental operation in computational genomics is to reduce the input sequences to their constituent k-mers. For maximum performance of downstream…”
    Získat plný text
    Paper
  6. 6

    Applying the Safe-And-Complete Framework to Practical Genome Assembly Autor Schmidt, Sebastian, Toivonen, Santeri, Medvedev, Paul, Tomescu, Alexandru I

    ISSN: 1868-8969, 1868-8969
    Vydáno: Germany 01.01.2024
    “…Despite the long history of genome assembly research, there remains a large gap between the theoretical and practical work. There is practical software with…”
    Zjistit podrobnosti o přístupu
    Journal Article