Suchergebnisse - coding (Algorithm OR Algorithmic)

Andere Suchmöglichkeiten:

  1. 41

    Upper Bounds for Linear Graph Codes von Leo Versteegen

    Veröffentlicht 2024
    Inhaltsangabe: “… Upper Bounds for Linear Graph Codes Leo Versteegen Random Structures & Algorithms ABSTRACTA linear …”
    Volltext
    Artículo Open Access
  2. 42

    Optimal Testing of Reed-Muller Codes with an Online Adversary von Kelman, Esty, Meir, Uri, Zheng, Kai Zhe

    Veröffentlicht 2026
    Inhaltsangabe: “… } for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \F^n …”
    Volltext
    Preprint
  3. 43

    Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications von De Marco, Gianluca, Kowalski, Dariusz R.

    Veröffentlicht 2025
    Inhaltsangabe: “… A superimposed code is a collection of binary vectors (codewords) with the property that no vector …”
    Volltext
    Preprint
  4. 44

    An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph von Liu, Gangli

    Veröffentlicht 2024
    Inhaltsangabe: “… or widest path problem in an undirected dense graph. It is a code implementation of the Algorithm 4 (MMJ …”
    Volltext
    Preprint
  5. 45

    Error Correction for Message Streams von Gupta, Meghal, Zhang, Rachel Yun

    Veröffentlicht 2023
    Inhaltsangabe: “… In the setting of error correcting codes, Alice wants to send a message $x \in \{0,1\}^n$ to Bob …”
    Volltext
    Preprint
  6. 46

    GridOT -- a discrete optimal transport solver on grids von Rauch, Johannes, Zanotti, Leo

    Veröffentlicht 2025
    Inhaltsangabe: “… . The source code is open source and publicly available.  …”
    Volltext
    Preprint
  7. 47

    Multi-View Structural Graph Summaries von Frank, Jonatan, Diera, Andor, Richerby, David, Scherp, Ansgar

    Veröffentlicht 2024
    Inhaltsangabe: “… , contributing two new ones. The datasets are of different domains (web graph, source code, and news) and sizes …”
    Volltext
    Preprint
  8. 48

    Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency von Lev-Ran, Asaf, Arkhipov, Pavel, Kolmogorov, Vladimir

    Veröffentlicht 2026
    Inhaltsangabe: “… ] that searches for frustrated cycles. Our code will be made available at https://github.com/vnk-ist/MAP-MRF/.  …”
    Volltext
    Preprint
  9. 49

    Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm von Arkhipov, Pavel, Kolmogorov, Vladimir

    Veröffentlicht 2026
    Inhaltsangabe: “… We implement an algorithm for solving the minimum weight perfect matching problem. Our code …”
    Volltext
    Preprint
  10. 50

    Better space-time-robustness trade-offs for set reconciliation von Belazzougui, Djamal, Kucherov, Gregory, Walzer, Stefan

    Veröffentlicht 2024
    Inhaltsangabe: “… on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic …”
    Volltext
    Preprint
  11. 51

    Carbonyl4: A Sketch for Set-Increment Mixed Updates von Zhao, Yikai, Wu, Yuhan, Yang, Tong

    Veröffentlicht 2024
    Inhaltsangabe: “… capability, achieved via a re-sampling and a heuristic approach. The source codes of Carbonyl4 are available …”
    Volltext
    Preprint
  12. 52

    Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies von Long, Yaowei, Pettie, Seth, Saranurak, Thatchaphol

    Veröffentlicht 2024
    Inhaltsangabe: “… uses an improved edge-expander hierarchy and a distributed coding technique based on Reed-Solomon codes …”
    Volltext
    Preprint
  13. 53

    ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations von Liu, Xilai, Tian, Yuxuan, Wang, Xiangyuan, Wu, Yuhan, Wu, Wenhao, Yang, Tong, Xie, Gaogang

    Veröffentlicht 2025
    Inhaltsangabe: “… and update speed across multiple layers of the network hierarchy. All related codes of ResidualSketch …”
    Volltext
    Preprint
  14. 54

    Intermediate N-Gramming: Deterministic and Fast N-Grams For Large N and Large Datasets von Curtin, Ryan R., Lu, Fred, Raff, Edward, Ranade, Priyanka

    Veröffentlicht 2025
    Inhaltsangabe: “… approach. Our code is available at https://github.com/rcurtin/Intergrams.  …”
    Volltext
    Preprint
  15. 55

    A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs von Kwok, Shawxing

    Veröffentlicht 2025
    Inhaltsangabe: “… implementation code is simplified and publicly available at https://github.com/ShawxingKwok/Kwok-algorithm …”
    Volltext
    Preprint
  16. 56

    The Probability That a Random Graph is Even‐Decomposable von Oliver Janzer, Fredy Yip

    Veröffentlicht 2025
    Inhaltsangabe: “… & Algorithms ABSTRACT A graph with an even number of edges is called even‐decomposable if there is a sequence …”
    Volltext
    Artículo Open Access
  17. 57

    Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study von Hochbaum, Dorit S., Irribarra-Cortés, Ayleen, Goldschmidt, Olivier, Asín-Achá, Roberto

    Veröffentlicht 2025
    Inhaltsangabe: “… performance of IPC. We provide here code and benchmarks, establishing IPC as a fast, scalable, and optimal …”
    Volltext
    Preprint
  18. 58

    Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs von Hu, Zhengding, Sun, Jingwen, Jiang, Le, Wang, Yuhao, Lin, Junqing, Zong, Yi, Sun, Guangzhong

    Veröffentlicht 2026
    Inhaltsangabe: “… -of-the-art implementations. Our code is open-sourced at https://github.com/Leo9660/MLMQ.git.  …”
    Volltext
    Preprint
  19. 59

    On the rank, Kernel, and core of sparse random graphs von Patrick DeMichele, Margalit Glasgow, Alexander Moreira

    Veröffentlicht 2024
    Inhaltsangabe: “… Moreira Random Structures & Algorithms AbstractWe study the rank of the adjacency matrix of a random Erdős …”
    Volltext
    Artículo Open Access
  20. 60

    SimiSketch: Efficiently Estimating Similarity of streaming Multisets von Dong, Fenghao, He, Yang, Liang, Yutong, Liu, Zirui, Wu, Yuhan, Chen, Peiqing, Yang, Tong

    Veröffentlicht 2024
    Inhaltsangabe: “… times. The complete source code is open-sourced and available on GitHub for reference.  …”
    Volltext
    Preprint