Suchergebnisse - decoding (algorithmics OR (Algorithms OR (algorithmicsics OR Algorithms)))

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

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

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

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

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

Inhaltsangabe: “… binary cyclic code decoding algorithm binary Hamming code For a given binary BCH code Cn of length n = 2 …”
Volltext

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

Inhaltsangabe: “… feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes …”
Volltext

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

Inhaltsangabe: “… that for any decoder (streaming algorithm) $A$ that on input $x$ computes $f(x)$ in space …”
Volltext

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

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

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

Inhaltsangabe: “… distribution over $\{0,1\}^n$. (1) We first give a quasi-polynomial time "list-decoding" algorithm …”
Volltext

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

Inhaltsangabe: “… on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic …”
Volltext

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

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

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

Inhaltsangabe: “… (KV) cache, where a job's memory footprint grows linearly with the number of decoded tokens …”
Volltext

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

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

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

Inhaltsangabe: “… . Recent work has seen tremendous progress in speeding up partitioning algorithms through parallelism …”
Volltext

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

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

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

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

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

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

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

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

Continuous Optimization for Decoding Errors von Srivastava, Shashank

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

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

Inhaltsangabe: “… on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder …”
Volltext

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

Inhaltsangabe: “… In list-decodable learning, we are given a set of data points such that an $α$-fraction …”
Volltext

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

Inhaltsangabe: “… decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding …”
Volltext