Resultados de búsqueda - decoding ((algorithmics OR algorithmsssics) OR (Algorithms OR (Algorithms OR algorithmsssicics)))

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

Tabla de Contenidos: “… code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever…”
Enlace del recurso

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

Tabla de Contenidos: “…. For such codes to be practically relevant, their decoders must successfully correct the most likely errors while…”
Enlace del recurso

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

Tabla de Contenidos: “… binary cyclic code decoding algorithm binary Hamming code For a given binary BCH code Cn of length n = 2…”
Enlace del recurso

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

Tabla de Contenidos: “… feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes…”
Enlace del recurso

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

Tabla de Contenidos: “… that for any decoder (streaming algorithm) $A$ that on input $x$ computes $f(x)$ in space…”
Enlace del recurso

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

Tabla de Contenidos: “…We give a simple, greedy $O(n^{ω+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques…”
Enlace del recurso

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

Tabla de Contenidos: “… distribution over $\{0,1\}^n$. (1) We first give a quasi-polynomial time "list-decoding" algorithm…”
Enlace del recurso

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

Tabla de Contenidos: “… on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic…”
Enlace del recurso

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

Tabla de Contenidos: “… of inliers $α$ is less than $1/2$. Our main result is an efficient list-decodable learner that recovers a…”
Enlace del recurso

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

Tabla de Contenidos: “… (KV) cache, where a job's memory footprint grows linearly with the number of decoded tokens…”
Enlace del recurso

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

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

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

Tabla de Contenidos: “…. Recent work has seen tremendous progress in speeding up partitioning algorithms through parallelism…”
Enlace del recurso

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

Tabla de Contenidos: “… rate by up to 2.3x with comparable decoding overhead. To assess practical utility, we integrate our…”
Enlace del recurso

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

Tabla de Contenidos: “…We give a polynomial-time algorithm that finds a planted clique of size $k \ge \sqrt{n \log n…”
Enlace del recurso

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

Tabla de Contenidos: “…-time</em> methods for large language models (LLMs)—e.g., <strong>MBR/eMBR decoding…”
Enlace del recurso

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

Tabla de Contenidos: “… efficient unique decoding algorithms in the semi-adversarial model. For interleaved Reed--Solomon (IRS…”
Enlace del recurso

Continuous Optimization for Decoding Errors por Srivastava, Shashank

Tabla de Contenidos: “… the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding…”
Enlace del recurso

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

Tabla de Contenidos: “… on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder…”
Enlace del recurso

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

Tabla de Contenidos: “…In list-decodable learning, we are given a set of data points such that an $α$-fraction…”
Enlace del recurso

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

Tabla de Contenidos: “… decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding…”
Enlace del recurso