Suchergebnisse - decoding ((Algorithms OR (algorithmics OR algorithmics)) OR algorithmsssic)
Andere Suchmöglichkeiten:
-
161
Smoothed Analysis of Learning from Positive Samples
Veröffentlicht 2025Inhaltsangabe: “… witnesses smoothness of $D^*$, as arises when list-decoding algorithms learn samplers for $D^*$ from …”
Volltext
Preprint -
162
Hardness of Maximum Likelihood Learning of DPPs
Veröffentlicht 2022Inhaltsangabe: “… the likelihood of the data is typically desirable. The algorithms used for this task to date either optimize over …”
Volltext
Preprint -
163
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
Veröffentlicht 2025Inhaltsangabe: “… methods minimize the number of measurements but often incur $Ω(n)$ decoding complexity, limiting large …”
Volltext
Preprint -
164
Entangled Mean Estimation in High-Dimensions
Veröffentlicht 2025Inhaltsangabe: “… computationally efficient algorithm achieving an information-theoretically near-optimal error. Specifically, we …”
Volltext
Preprint -
165
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
Veröffentlicht 2025Inhaltsangabe: “… results are general compilers that take any Congested Clique algorithm and simulate it, in a round …”
Volltext
Preprint -
166
Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
Veröffentlicht 2026Inhaltsangabe: “… decoding (ranking/unranking) algorithms. In this paper we develop the first polynomial time/space decoding …”
Volltext
Preprint -
167
Coupling without Communication and Drafter-Invariant Speculative Decoding
Veröffentlicht 2024Inhaltsangabe: “… algorithm. This bound was shown to be optimal in the worst-case by [Bavarian et al., 2020]. In this work, we …”
Volltext
Preprint -
168
Recursive decoding of binary rank Reed-Muller codes and Plotkin construction for matrix codes
Veröffentlicht 2025Inhaltsangabe: “… complexity beats that of the recently proposed decoding algorithm for arbitrary rank metric Reed-Muller codes …”
Volltext
Preprint -
169
The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
Veröffentlicht 2026Inhaltsangabe: “… The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing …”
Volltext
Preprint -
170
Compression with Privacy-Preserving Random Access
Veröffentlicht 2025Inhaltsangabe: “… at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information …”
Volltext
Preprint -
171
Data-driven decoding of quantum error correcting codes using graph neural networks
Veröffentlicht 2023Inhaltsangabe: “… whereas decoders based on more efficient algorithms give sub-optimal performance. In addition …”
Volltext
Preprint -
172
Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation
Veröffentlicht 2025Inhaltsangabe: “… Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation Jiayi …”
Volltext
Artículo Open Access -
173
Retrieval with Learned Similarities
Veröffentlicht 2024Inhaltsangabe: “… (MIPS) algorithms for efficient retrieval. However, state-of-the-art retrieval algorithms have migrated …”
Volltext
Preprint -
174
Comparison of linear and nonlinear methods for decoding selective attention to speech from ear-EEG recordings
Veröffentlicht 2024Inhaltsangabe: “… decoding algorithms were next compared, including stimulus-reconstruction algorithms based on linear …”
Volltext
Preprint -
175
Average-Case Complexity of Quantum Stabilizer Decoding
Veröffentlicht 2025Inhaltsangabe: “… of the algorithmic hardness of decoding random quantum versus random classical codes. We prove that decoding a random …”
Volltext
Preprint -
176
SpecTr: Fast Speculative Decoding via Optimal Transport
Veröffentlicht 2023Inhaltsangabe: “… , and even prohibitive in certain tasks. One way to speed up sampling is $\textit{speculative decoding}$: use …”
Volltext
Preprint -
177
Block Verification Accelerates Speculative Decoding
Veröffentlicht 2024Inhaltsangabe: “… guarantee of the standard speculative decoding verification algorithm, cannot deteriorate performance …”
Volltext
Preprint -
178
Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
Veröffentlicht 2025Inhaltsangabe: “… , burst errors often allow for the design of more efficient decoding algorithms. However, achieving both …”
Volltext
Preprint -
179
Explicit Good Codes Approaching Distance 1 in Ulam Metric
Veröffentlicht 2024Inhaltsangabe: “… $ in poly$(n)$ time and can also decode in poly$(n)$ time, a permutation $π$ on $[n]$ to its closest …”
Volltext
Preprint -
180
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
Veröffentlicht 2024Inhaltsangabe: “… , by exhibiting a class of block MDPs and associated decoding functions where reward-free exploration is provably …”
Volltext
Preprint