Risultati della ricerca - coding (algorithm OR Algorithms)

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

Sommario: “.... It seems Algorithm 4 is the first algorithm that has an actual code implementation for solving the APPD...”
Testo

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

Sommario: “...We implement an algorithm for solving the minimum weight perfect matching problem. Our code...”
Testo

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

Sommario: “...We provide an improved implementation of Schmitzer's sparse multi-scale algorithm for discrete...”
Testo

RCM++:Reverse Cuthill-McKee ordering with Bi-Criteria Node Finder di Hou, JiaJun, Liu, HongJie, Zhu, ShengXin

Sommario: “.... This advancement fosters the further application and development of the RCM algorithm.The code related...”
Testo

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

Sommario: “... recover the top-k most frequent n-grams? We devise a multi-pass algorithm called Intergrams...”
Testo

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

Sommario: “... necessitates algorithms that efficiently handle both SET and INCREMENT operations. We present Carbonyl4...”
Testo

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

Sommario: “.... We introduce multi-view structural graph summaries and propose an algorithm for merging two summaries...”
Testo

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

Sommario: “... algorithms face computational and scalability limitations, leading to the adoption of faster, but non-optimal...”
Testo

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

Sommario: “... implementation code is simplified and publicly available at https://github.com/ShawxingKwok/Kwok-algorithm...”
Testo

Implementation of CR Energy SPectrum (CRESP) algorithm in PIERNIK MHD code. II. Propagation... di Baldacchino-Jordan, Antoine, Hanasz, Michał, Ogrodnik, Mateusz, Wóltański, Dominik, Gawryszczak, Artur, Strong, Andrew W., Girichidis, Philipp

Sommario: “...) module of the PIERNIK MHD code. We extend the algorithm to several CR nuclei and demonstrate our code...”
Testo

Wind‐assisted microgrid grid code compliance employing a hybrid Particle swarm optimization‐Artificial hummingbird algorithm optimizer‐tuned STATCOM di Saqif Imtiaz, Lijun Yang, Hafiz Muhammad Azib Khan, Hafiz Mudassir Munir, Mohammed Alharbi, Mohsin Jamil

Sommario: “...Wind‐assisted microgrid grid code compliance employing a hybrid Particle swarm optimization...”
Testo

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

Sommario: “... graph streams. To address this, approximate algorithms have been developed, but existing distributed...”
Testo

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

Sommario: “... method, as well as the two-level color-coding of Bringmann (2017) and the SMAWK algorithm on tall...”
Testo

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

Sommario: “...In the setting of error correcting codes, Alice wants to send a message $x \in \{0,1\}^n$ to Bob...”
Testo

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

Sommario: “... the size of the search space for FPT algorithms parameterized by $k$. We investigate under which conditions...”
Testo

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

Sommario: “.... It works by running the Singleton Arc Consistency algorithm in a certain CSP instance. Experimental results...”
Testo

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

Sommario: “... algorithm designed to tackle this specific problem. The paper begins by presenting two simpler versions...”
Testo

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

Sommario: “... (un-)designability, and design scalable and interpretable algorithms to identify minimal undesignable...”
Testo

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

Sommario: “.... Specifically, we study Binary Search Trees (BSTs) and Huffman coding, two fundamental techniques...”
Testo

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

Sommario: “... on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic...”
Testo