Risultati della ricerca - decoding (algorithmssic OR (algorithm OR Algorithms))

  1. 141

    Dynamic programming by polymorphic semiring algebraic shortcut fusion di Little, Max A., He, Xi, Kayas, Ugur

    Pubblicazione 2021
    Sommario: “...Dynamic programming (DP) is an algorithmic design paradigm for the efficient, exact solution...”
    Testo
    Preprint
  2. 142

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

    Pubblicazione 2025
    Sommario: “... methods minimize the number of measurements but often incur $Ω(n)$ decoding complexity, limiting large...”
    Testo
    Preprint
  3. 143

    SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications di Diakonikolas, Ilias, Hopkins, Samuel B., Pensia, Ankit, Tiegel, Stefan

    Pubblicazione 2024
    Sommario: “...-certifiably subgaussian} -- a condition that yields efficient learning algorithms for a wide variety of high...”
    Testo
    Preprint
  4. 144

    Batch List-Decodable Linear Regression via Higher Moments di Diakonikolas, Ilias, Kane, Daniel M., Karmalkar, Sushrut, Liu, Sihan, Pittas, Thanasis

    Pubblicazione 2025
    Sommario: “...We study the task of list-decodable linear regression using batches. A batch is called clean...”
    Testo
    Preprint
  5. 145

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

    Pubblicazione 2025
    Sommario: “... witnesses smoothness of $D^*$, as arises when list-decoding algorithms learn samplers for $D^*$ from...”
    Testo
    Preprint
  6. 146

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

    Pubblicazione 2022
    Sommario: “... the likelihood of the data is typically desirable. The algorithms used for this task to date either optimize over...”
    Testo
    Preprint
  7. 147

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

    Pubblicazione 2025
    Sommario: “... computationally efficient algorithm achieving an information-theoretically near-optimal error. Specifically, we...”
    Testo
    Preprint
  8. 148

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

    Pubblicazione 2025
    Sommario: “... results are general compilers that take any Congested Clique algorithm and simulate it, in a round...”
    Testo
    Preprint
  9. 149

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

    Pubblicazione 2025
    Sommario: “... at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information...”
    Testo
    Preprint
  10. 150

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

    Pubblicazione 2024
    Sommario: “... algorithm. This bound was shown to be optimal in the worst-case by [Bavarian et al., 2020]. In this work, we...”
    Testo
    Preprint
  11. 151

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

    Pubblicazione 2026
    Sommario: “... decoding (ranking/unranking) algorithms. In this paper we develop the first polynomial time/space decoding...”
    Testo
    Preprint
  12. 152

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

    Pubblicazione 2025
    Sommario: “... complexity beats that of the recently proposed decoding algorithm for arbitrary rank metric Reed-Muller codes...”
    Testo
    Preprint
  13. 153

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

    Pubblicazione 2026
    Sommario: “...The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing...”
    Testo
    Preprint
  14. 154

    Decoding algorithms for surface codes di iOlius, Antonio deMarti, Fuentes, Patricio, Orús, Román, Crespo, Pedro M., Martinez, Josu Etxezarreta

    Pubblicazione 2023
    Sommario: “... subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state...”
    Testo
    Preprint
  15. 155
  16. 156

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

    Pubblicazione 2025
    Sommario: “...Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation Jiayi...”
    Testo
    Artículo Open Access
  17. 157

    Quantum algorithms for scientific computing di Au-Yeung, R., Camino, B., Rathore, O., Kendon, V.

    Pubblicazione 2023
    Sommario: “... challenges include encoding and decoding classical data for quantum devices, and mismatched clock speeds...”
    Testo
    Preprint
  18. 158

    Carrying over algorithm in transformers di Kruthoff, Jorrit

    Pubblicazione 2024
    Sommario: “... using the carrying over algorithm. This algorithm consists of two tasks: adding digits in the same...”
    Testo
    Preprint
  19. 159

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

    Pubblicazione 2024
    Sommario: “... (MIPS) algorithms for efficient retrieval. However, state-of-the-art retrieval algorithms have migrated...”
    Testo
    Preprint
  20. 160

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

    Pubblicazione 2024
    Sommario: “... decoding algorithms were next compared, including stimulus-reconstruction algorithms based on linear...”
    Testo
    Preprint