Risultati della ricerca - decoding ((algorithmics OR (algorithmsssicsics OR algorithmssics)) OR (Algorithms OR Algorithms))

Tight bounds for stream decodable error-correcting codes di Gupta, Meghal, Guruswami, Venkatesan, Singhal, Mihir

Sommario: “... code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever...”
Testo

Generalized matching decoders for 2D topological translationally-invariant codes di Tan, Shi Jie Samuel, Gill, Ian, Huang, Eric, Liu, Pengyu, Zhao, Chen, Dehghani, Hossein, Kubica, Aleksander, Zhou, Hengyun, Dua, Arpit

Sommario: “.... For such codes to be practically relevant, their decoders must successfully correct the most likely errors while...”
Testo

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code di TARIQ SHAH

Sommario: “... binary cyclic code decoding algorithm binary Hamming code For a given binary BCH code Cn of length n = 2...”
Testo

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing di Uroić, Leon Stjepan, Đurasević, Marko

Sommario: “... feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes...”
Testo

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

Sommario: “... that for any decoder (streaming algorithm) $A$ that on input $x$ computes $f(x)$ in space...”
Testo

Semirandom Planted Clique and the Restricted Isometry Property di Błasiok, Jarosław, Buhai, Rares-Darius, Kothari, Pravesh K., Steurer, David

Sommario: “...We give a simple, greedy $O(n^{ω+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques...”
Testo

DNF Learning via Locally Mixing Random Walks di Alman, Josh, Nadimpalli, Shivam, Patel, Shyamal, Servedio, Rocco A.

Sommario: “... distribution over $\{0,1\}^n$. (1) We first give a quasi-polynomial time "list-decoding" algorithm...”
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

First Order Stochastic Optimization with Oblivious Noise di Diakonikolas, Ilias, Karmalkar, Sushrut, Park, Jongho, Tzamos, Christos

Sommario: “... of inliers $α$ is less than $1/2$. Our main result is an efficient list-decodable learner that recovers a...”
Testo

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference di Feng, Yiding, Yang, Zonghan, Zhang, Yuhao

Sommario: “... (KV) cache, where a job's memory footprint grows linearly with the number of decoded tokens...”
Testo

Towards Settling the Complexity of the Lettericity Problem di Grobler, Mario, Morawietz, Nils, Sacher, Silas Cato

Sommario: “...$ such that there is a word $w_1 \dots w_{|V|} \in Σ^*$ and a decoder $\mathcal{D} \subseteq Σ^2$ with the property...”
Testo

Tera-Scale Multilevel Graph Partitioning di Salwasser, Daniel, Seemaier, Daniel, Gottesbüren, Lars, Sanders, Peter

Sommario: “.... Recent work has seen tremendous progress in speeding up partitioning algorithms through parallelism...”
Testo

HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination di Zhao, Tianyu, Zhao, Dongfang, Guo, Luanzheng, Tallent, Nathan

Sommario: “... rate by up to 2.3x with comparable decoding overhead. To assess practical utility, we integrate our...”
Testo

Semirandom Planted Clique via 1-norm Isometry Property di Guruswami, Venkatesan, Wang, Hsin-Po

Sommario: “...We give a polynomial-time algorithm that finds a planted clique of size $k \ge \sqrt{n \log n...”
Testo

Inference in Normal Form: Unifying LLM Tricks via TRoT di Takahashi, K

Sommario: “...-time</em> methods for large language models (LLMs)—e.g., <strong>MBR/eMBR decoding...”
Testo

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors di Brakensiek, Joshua, Chen, Yeyuan, Dhar, Manik, Zhang, Zihan

Sommario: “... efficient unique decoding algorithms in the semi-adversarial model. For interleaved Reed--Solomon (IRS...”
Testo

Continuous Optimization for Decoding Errors di Srivastava, Shashank

Sommario: “... the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding...”
Testo

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics di Peikert, Chris, Hostetler, Alexandra Veliche

Sommario: “... on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder...”
Testo

High-Accuracy List-Decodable Mean Estimation di Chen, Ziyun, Compton, Spencer, Kane, Daniel, Li, Jerry

Sommario: “...In list-decodable learning, we are given a set of data points such that an $α$-fraction...”
Testo

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes di Ashvinkumar, Vikrant, Habib, Mursalin, Srivastava, Shashank

Sommario: “... decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding...”
Testo