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

  1. 161

    Smoothed Analysis of Learning from Positive Samples por Lee, Jane H., Mehrotra, Anay, Zampetakis, Manolis

    Publicado 2025
    Tabla de Contenidos: “… witnesses smoothness of $D^*$, as arises when list-decoding algorithms learn samplers for $D^*$ from…”
    Enlace del recurso
    Preprint
  2. 162

    Hardness of Maximum Likelihood Learning of DPPs por Grigorescu, Elena, Juba, Brendan, Wimmer, Karl, Xie, Ning

    Publicado 2022
    Tabla de Contenidos: “… the likelihood of the data is typically desirable. The algorithms used for this task to date either optimize over…”
    Enlace del recurso
    Preprint
  3. 163

    Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time por Li, Xiaxin, Mazumdar, Arya

    Publicado 2025
    Tabla de Contenidos: “… methods minimize the number of measurements but often incur $Ω(n)$ decoding complexity, limiting large…”
    Enlace del recurso
    Preprint
  4. 164

    Entangled Mean Estimation in High-Dimensions por Diakonikolas, Ilias, Kane, Daniel M., Liu, Sihan, Pittas, Thanasis

    Publicado 2025
    Tabla de Contenidos: “… computationally efficient algorithm achieving an information-theoretically near-optimal error. Specifically, we…”
    Enlace del recurso
    Preprint
  5. 165

    All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free por Fischer, Orr, Parter, Merav

    Publicado 2025
    Tabla de Contenidos: “… results are general compilers that take any Congested Clique algorithm and simulate it, in a round…”
    Enlace del recurso
    Preprint
  6. 166

    Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences por Gabric, Daniel, Imam, Wazed, Jones, Lukas Janik, Sawada, Joe

    Publicado 2026
    Tabla de Contenidos: “… decoding (ranking/unranking) algorithms. In this paper we develop the first polynomial time/space decoding…”
    Enlace del recurso
    Preprint
  7. 167

    Coupling without Communication and Drafter-Invariant Speculative Decoding por Daliri, Majid, Musco, Christopher, Suresh, Ananda Theertha

    Publicado 2024
    Tabla de Contenidos: “… algorithm. This bound was shown to be optimal in the worst-case by [Bavarian et al., 2020]. In this work, we…”
    Enlace del recurso
    Preprint
  8. 168

    Recursive decoding of binary rank Reed-Muller codes and Plotkin construction for matrix codes por Couvreur, Alain, Pratihar, Rakhi

    Publicado 2025
    Tabla de Contenidos: “… complexity beats that of the recently proposed decoding algorithm for arbitrary rank metric Reed-Muller codes…”
    Enlace del recurso
    Preprint
  9. 169

    The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding por Gu, Shouzhen, Wang, Lily, Kubica, Aleksander

    Publicado 2026
    Tabla de Contenidos: “…The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing…”
    Enlace del recurso
    Preprint
  10. 170

    Compression with Privacy-Preserving Random Access por Chandar, Venkat, Tchamkerten, Aslan, Vatedka, Shashank

    Publicado 2025
    Tabla de Contenidos: “… at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information…”
    Enlace del recurso
    Preprint
  11. 171
  12. 172

    Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation por Jiayi Fu, Shouzhi Zheng, Longjiang Fan, Xiaoming Zheng, Qian Qian

    Publicado 2025
    Tabla de Contenidos: “…Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation Jiayi…”
    Enlace del recurso
    Artículo Open Access
  13. 173

    Retrieval with Learned Similarities por Ding, Bailu, Zhai, Jiaqi

    Publicado 2024
    Tabla de Contenidos: “… (MIPS) algorithms for efficient retrieval. However, state-of-the-art retrieval algorithms have migrated…”
    Enlace del recurso
    Preprint
  14. 174

    Comparison of linear and nonlinear methods for decoding selective attention to speech from ear-EEG recordings por Thornton, Mike, Mandic, Danilo, Reichenbach, Tobias

    Publicado 2024
    Tabla de Contenidos: “… decoding algorithms were next compared, including stimulus-reconstruction algorithms based on linear…”
    Enlace del recurso
    Preprint
  15. 175

    Average-Case Complexity of Quantum Stabilizer Decoding por Khesin, Andrey Boris, Lu, Jonathan Z., Poremba, Alexander, Ramkumar, Akshar, Vaikuntanathan, Vinod

    Publicado 2025
    Tabla de Contenidos: “… of the algorithmic hardness of decoding random quantum versus random classical codes. We prove that decoding a random…”
    Enlace del recurso
    Preprint
  16. 176

    SpecTr: Fast Speculative Decoding via Optimal Transport por Sun, Ziteng, Suresh, Ananda Theertha, Ro, Jae Hun, Beirami, Ahmad, Jain, Himanshu, Yu, Felix

    Publicado 2023
    Tabla de Contenidos: “…, and even prohibitive in certain tasks. One way to speed up sampling is $\textit{speculative decoding}$: use…”
    Enlace del recurso
    Preprint
  17. 177

    Block Verification Accelerates Speculative Decoding por Sun, Ziteng, Mendlovic, Uri, Leviathan, Yaniv, Aharoni, Asaf, Ro, Jae Hun, Beirami, Ahmad, Suresh, Ananda Theertha

    Publicado 2024
    Tabla de Contenidos: “… guarantee of the standard speculative decoding verification algorithm, cannot deteriorate performance…”
    Enlace del recurso
    Preprint
  18. 178

    Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound por Li, Songsong, Liu, Shu, Ma, Liming, Wan, Yunqi, Xing, Chaoping

    Publicado 2025
    Tabla de Contenidos: “…, burst errors often allow for the design of more efficient decoding algorithms. However, achieving both…”
    Enlace del recurso
    Preprint
  19. 179

    Explicit Good Codes Approaching Distance 1 in Ulam Metric por Goldenberg, Elazar, Habib, Mursalin, S, Karthik C.

    Publicado 2024
    Tabla de Contenidos: “…$ in poly$(n)$ time and can also decode in poly$(n)$ time, a permutation $π$ on $[n]$ to its closest…”
    Enlace del recurso
    Preprint
  20. 180

    Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning por Golowich, Noah, Moitra, Ankur, Rohatgi, Dhruv

    Publicado 2024
    Tabla de Contenidos: “…, by exhibiting a class of block MDPs and associated decoding functions where reward-free exploration is provably…”
    Enlace del recurso
    Preprint