Risultati della ricerca - coding Algorithm

Dual Numbers for Algorithmic Differentiation di F. Peñuñuri

Sommario: “...Dual Numbers for Algorithmic Differentiation F. Peñuñuri O. Carvente M.A. Zambrano-Arjona R. Peón...”
Testo
Testo
Testo
Testo
Testo

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

Sommario: “...} for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \F^n...”
Testo

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

Sommario: “...A superimposed code is a collection of binary vectors (codewords) with the property that no vector...”
Testo

Inputs and Outputs for Blender Algorithm di Dechow, Jack, Durand, Michael

Sommario: “... written for use in MATLAB, so element values start at 1. Sample code to construct the grid from this data...”
Testo

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

Sommario: “... or widest path problem in an undirected dense graph. It is a code implementation of the Algorithm 4 (MMJ...”
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

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

Sommario: “.... The source code is open source and publicly available. ...”
Testo

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

Sommario: “..., contributing two new ones. The datasets are of different domains (web graph, source code, and news) and sizes...”
Testo

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

Sommario: “...] that searches for frustrated cycles. Our code will be made available at https://github.com/vnk-ist/MAP-MRF/. ...”
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

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

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

Sommario: “... capability, achieved via a re-sampling and a heuristic approach. The source codes of Carbonyl4 are available...”
Testo

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

Sommario: “... uses an improved edge-expander hierarchy and a distributed coding technique based on Reed-Solomon codes...”
Testo

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

Sommario: “... and update speed across multiple layers of the network hierarchy. All related codes of ResidualSketch...”
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: “... approach. Our code is available at https://github.com/rcurtin/Intergrams. ...”
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

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

Sommario: “... & Algorithms ABSTRACT A graph with an even number of edges is called even‐decomposable if there is a sequence...”
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: “... performance of IPC. We provide here code and benchmarks, establishing IPC as a fast, scalable, and optimal...”
Testo

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

Sommario: “...-of-the-art implementations. Our code is open-sourced at https://github.com/Leo9660/MLMQ.git. ...”
Testo

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

Sommario: “... Moreira Random Structures & Algorithms AbstractWe study the rank of the adjacency matrix of a random Erdős...”
Testo