Risultati della ricerca - coding (algorithmicsics OR (Algorithms OR (algorithmics OR algorithmicsics)))

Teaching Algorithm Design: A Literature Review di Liu, Jonathan, Poulsen, Seth, Goodwin, Erica, Chen, Hongxuan, Williams, Grace, Gertner, Yael, Franklin, Diana

Sommario: “...Algorithm design is a vital skill developed in most undergraduate Computer Science (CS) programs...”
Testo

Traversing combinatorial 0/1-polytopes via optimization di Merino, Arturo, Mütze, Torsten

Sommario: “... method relies on a simple and versatile algorithm for computing a Hamilton path on the skeleton of any 0...”
Testo

On the Enumeration of all Unique Paths of Recombining Trinomial Trees di Torres, Ethan, Sreenivas, Ramavarapu, Sowers, Richard

Sommario: “... compositions. Leveraging these, we introduce a mass-shifting enumeration algorithm that slides integer "masses...”
Testo

RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication di Dehghankar, Mohsen, Asudeh, Abolfazl

Sommario: “... computation. In parallel, algorithms such as Redundant Segment Reduction (RSR) provide theoretical guarantees...”
Testo

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification di Jeronimo, Fernando Granha, Mittal, Tushant, Roy, Sourya, Wigderson, Avi

Sommario: “...We give an efficient algorithm that transforms any bounded degree expander graph into another...”
Testo

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets di Alrabiah, Omar, Guo, Zeyu, Guruswami, Venkatesan, Li, Ray, Zhang, Zihan

Sommario: “...Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low...”
Testo

Unbounded Error Correcting Codes di Efremenko, Klim, Zamir, Or

Sommario: “...Traditional error-correcting codes (ECCs) assume a fixed message length, but many scenarios involve...”
Testo

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation di Li, Hui, Deng, Shiyuan, Yan, Xiao, Zhi, Xiangyu, Cheng, James

Sommario: “.... An efficient dynamic programming algorithm is developed to optimize dimension segmentation and bit allocation...”
Testo

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets di Con, Roni, Guo, Zeyu, Li, Ray, Zhang, Zihan

Sommario: “...In this paper, we prove that with high probability, random Reed-Solomon codes approach the half...”
Testo

Greedy Gray Codes for some Restricted Classes of Binary Words di Hassler, Nathanaël, Vajnovszki, Vincent, Wong, Dennis

Sommario: “...We investigate the existence of greedy Gray codes, based on the choice of the first element...”
Testo

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets di Guo, Zeyu, Zhang, Zihan

Sommario: “...This paper shows that, with high probability, randomly punctured Reed-Solomon codes over fields...”
Testo

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches di Naik, Ranjan N

Sommario: “... backtracking algorithm. We report successful computational verification for all frequency partitions...”
Testo

PtrHash: Minimal Perfect Hashing at RAM Throughput di Koerkamp, Ragnar Groot

Sommario: “... to it. PtrHash builds on this by using 1) fixed-width (uncompressed) 8-bit pilots, 2) a construction algorithm...”
Testo

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs di Abboud, Amir, Safier, Ron, Wallheimer, Nathan

Sommario: “... the induced $H$-freeness property, via a new color-coding-like reduction. ...”
Testo

Learned Static Function Data Structures di Hermann, Stefan, Lehmann, Hans-Peter, Vinciguerra, Giorgio, Walzer, Stefan

Sommario: “... predicts a probability distribution over the values, from which we derive a key-specific prefix code...”
Testo

Declarative Concurrent Data Structures di Raza, Aun, Nicholson, Hamish, Tsakalidou, Ioanna, Herlihy, Anna, Tagore, Prathamesh, Ailamaki, Anastasia

Sommario: “... code. A declarative interface for designing data structure enables efficient composability through co...”
Testo

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search di Shi, Jifan, Gao, Jianyang, Xia, James, Fehér, Tamás Béla, Long, Cheng

Sommario: “... distance computation schemes for RaBitQ codes and a fused search kernel to achieve high throughput...”
Testo

Performance and error modeling of Deutsch’s algorithm in IBM Q di E. Buksman

Sommario: “...Performance and error modeling of Deutsch’s algorithm in IBM Q E. Buksman A. L. Fonseca de Oliveira...”
Testo

Minimising surface-code failures using a color-code decoder di Benhemou, Asmae, Sahay, Kaavya, Lao, Lingling, Brown, Benjamin J.

Sommario: “... color-code decoding algorithms. Analytical arguments and exhaustive testing show that the resulting...”
Testo

MoadeeB - first (pre-)release di Gec, Boštjan

Sommario: “...;MoadeeB is an algorithm implemented in Python for the discovery of exact equations (e.g. from integer...”
Testo