Risultati della ricerca - decoding (algorithmssics OR (Algorithms OR ((algorithmssics OR algorithmssssics) 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

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: “... where Bob is a low space decoder. More precisely, he receives Alice's encoding $\text{enc}(x)$ bit...”
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

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

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

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

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

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

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

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

Sommario: “... neighborhood by on-the-fly decoding at speeds close to the uncompressed graph. Combining these optimizations...”
Testo

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

Sommario: “... property. Inspired by Wootters's work on list decoding, we put forth and implement the $1$-norm analog...”
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

Continuous Optimization for Decoding Errors di Srivastava, Shashank

Sommario: “... to support decoding, which is the task of recovering a codeword from its noisy copy. List decoding is a...”
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

Minimum-Weight Parity Factor Decoder for Quantum Error Correction di Wu, Yue, Li, Binghong, Chang, Kathleen, Puri, Shruti, Zhong, Lin

Sommario: “...Fast and accurate quantum error correction (QEC) decoding is crucial for scalable fault-tolerant...”
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

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

Sommario: “...Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new...”
Testo

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I di Jeronimo, Fernando Granha, Singh, Aman

Sommario: “...We present near-linear time list decoding algorithms (in the block-length $n$) for expander-based...”
Testo