Resultados de búsqueda - coding (algorithmics OR (Algorithms OR algorithmicsic))

  1. 81

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

    Publicado 2025
    Tabla de Contenidos: “… recover the top-k most frequent n-grams? We devise a multi-pass algorithm called Intergrams…”
    Enlace del recurso
    Preprint
  2. 82

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

    Publicado 2024
    Tabla de Contenidos: “… necessitates algorithms that efficiently handle both SET and INCREMENT operations. We present Carbonyl4…”
    Enlace del recurso
    Preprint
  3. 83

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

    Publicado 2024
    Tabla de Contenidos: “…. We introduce multi-view structural graph summaries and propose an algorithm for merging two summaries…”
    Enlace del recurso
    Preprint
  4. 84

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

    Publicado 2025
    Tabla de Contenidos: “… algorithms face computational and scalability limitations, leading to the adoption of faster, but non-optimal…”
    Enlace del recurso
    Preprint
  5. 85

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

    Publicado 2025
    Tabla de Contenidos: “… implementation code is simplified and publicly available at https://github.com/ShawxingKwok/Kwok-algorithm…”
    Enlace del recurso
    Preprint
  6. 86
  7. 87
  8. 88

    DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams por Xuan, Wei, Liang, Yan, Cao, Huawei, Lin, Ning, Ye, Xiaochun, Fan, Dongrui

    Publicado 2025
    Tabla de Contenidos: “… graph streams. To address this, approximate algorithms have been developed, but existing distributed…”
    Enlace del recurso
    Preprint
  9. 89

    0-1 Knapsack in Nearly Quadratic Time por Jin, Ce

    Publicado 2023
    Tabla de Contenidos: “… method, as well as the two-level color-coding of Bringmann (2017) and the SMAWK algorithm on tall…”
    Enlace del recurso
    Preprint
  10. 90

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

    Publicado 2023
    Tabla de Contenidos: “…In the setting of error correcting codes, Alice wants to send a message $x \in \{0,1\}^n$ to Bob…”
    Enlace del recurso
    Preprint
  11. 91

    Preprocessing to Reduce the Search Space for Odd Cycle Transversal por Jansen, Bart M. P., Mizutani, Yosuke, Sullivan, Blair D., Verhaegh, Ruben F. A.

    Publicado 2024
    Tabla de Contenidos: “… the size of the search space for FPT algorithms parameterized by $k$. We investigate under which conditions…”
    Enlace del recurso
    Preprint
  12. 92

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

    Publicado 2026
    Tabla de Contenidos: “…. It works by running the Singleton Arc Consistency algorithm in a certain CSP instance. Experimental results…”
    Enlace del recurso
    Preprint
  13. 93

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

    Publicado 2024
    Tabla de Contenidos: “… algorithm designed to tackle this specific problem. The paper begins by presenting two simpler versions…”
    Enlace del recurso
    Preprint
  14. 94

    Scalable and Interpretable Identification of Minimal Undesignable RNA Structure Motifs with Rotational Invariance por Zhou, Tianshuo, Tang, Wei Yu, Malik, Apoorv, Mathews, David H., Huang, Liang

    Publicado 2024
    Tabla de Contenidos: “… (un-)designability, and design scalable and interpretable algorithms to identify minimal undesignable…”
    Enlace del recurso
    Preprint
  15. 95

    Scenario-Based Robust Optimization of Tree Structures por Angelopoulos, Spyros, Dürr, Christoph, Elenter, Alex, Melidi, Georgii

    Publicado 2024
    Tabla de Contenidos: “…. Specifically, we study Binary Search Trees (BSTs) and Huffman coding, two fundamental techniques…”
    Enlace del recurso
    Preprint
  16. 96

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

    Publicado 2024
    Tabla de Contenidos: “… on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic…”
    Enlace del recurso
    Preprint
  17. 97

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

    Publicado 2025
    Tabla de Contenidos: “… algorithm for HHH detection in hierarchical traffic analysis. ResidualSketch distinguishes itself…”
    Enlace del recurso
    Preprint
  18. 98

    Median and Small Parsimony Problems on RNA trees por Marchand, Bertrand, Anselmetti, Yoann, Lafond, Manuel, Ouangraoua, Aïda

    Publicado 2024
    Tabla de Contenidos: “…Motivation: Non-coding RNAs (ncRNAs) express their functions by adopting molecular structures…”
    Enlace del recurso
    Preprint
  19. 99

    LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations por Hong, Xin, Dai, Aochu, Gao, Dingchao, Li, Sanjiang, Ji, Zhengfeng, Ying, Mingsheng

    Publicado 2025
    Tabla de Contenidos: “… tasks. We present efficient algorithms for normalization, slicing, addition, and contraction, critical…”
    Enlace del recurso
    Preprint
  20. 100

    Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition por Zhou, Tianshuo, Mathews, David H., Huang, Liang

    Publicado 2026
    Tabla de Contenidos: “… programming algorithm that efficiently searches over exponentially many decompositions and identifies…”
    Enlace del recurso
    Preprint