Risultati della ricerca - coding (Algorithm OR Algorithms)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication di Ly, Hoang, Soljanin, Emina, Schleppy, Michael

Sommario: “...Maximum-likelihood (ML) decoding for arbitrary block codes remains fundamentally hard, with worst...”
Testo

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding di Guruswami, Venkatesan, Wang, Hsin-Po

Sommario: “... to the market is a redesigned Reed--Solomon code for probabilistic list-decoding at diminishing code rates over...”
Testo

Gray Codes With Constant Delay and Constant Auxiliary Space di Amarilli, Antoine, David, Claire, Francis, Nadime, Marsault, Victor, Monet, Mikaël, Strozecki, Yann

Sommario: “...We give the first two algorithms to enumerate all binary words of $\{0,1\}^\ell$ (like Gray codes...”
Testo

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph di Fernández-Menduiña, Samuel, Pavez, Eduardo, Ortega, Antonio

Sommario: “... coding transforms belong to this class of GFTs, which we denote by DCT+. Next, starting from an arbitrary...”
Testo

Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing di Courtney, Joshua M.

Sommario: “...We analyze permutation routing of rigid blocks representing surface code patches of $d_C^2$ atoms...”
Testo

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut di Parekh, Ojas

Sommario: “... of DQI tailored for MaxCut that relies on elementary graph theory instead of coding theory to motivate...”
Testo

Masked Matrix Multiplication for Emergent Sparsity di Wheatman, Brian, Madhyastha, Meghana, Burns, Randal

Sommario: “... and avoids branches based on a runtime evaluation of sparsity. We use a combination of dynamic code lookup...”
Testo

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity di Sato, Atsuki, Matsui, Yusuke

Sommario: “... the empirical success of Learned Sort, and provides evidence for why Learned Sort is fast. The code is available...”
Testo

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm di Arhire, Andrei, Chiriac, Matei, Timofte, Radu

Sommario: “... in algorithmic fields, including graph theory and combinatorics. The 2023 edition of the Parameterized Algorithms...”
Testo

Towards counterfactual fairness through auxiliary variables di Tian, Bowei, Wang, Ziyao, He, Shwai, Ye, Wanghao, Sun, Guoheng, Dai, Yucong, Wu, Yongkai, Li, Ang

Sommario: “... state-of-the-art approaches in achieving counterfactual fairness. Our code is available at https...”
Testo

Quantum Sketches, Hashing, and Approximate Nearest Neighbors di Hashemian, Sajjad

Sommario: “... any such sketch requires $m=Ω(n)$ qubits, via a reduction to quantum random access codes and Nayak...”
Testo

Kernels for Storage Capacity and Dual Index Coding di Haviv, Ishay

Sommario: “... and by its intimate relations to the index coding problem from the area of network information theory...”
Testo

Towards Efficient Hash Maps in Functional Array Languages di Due, William Henrich, Elsman, Martin, Henriksen, Troels

Sommario: “... difference is due to low-level code generation limitation in the Futhark compiler, and to which extent it can...”
Testo

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra di Ding, Zhiyan, Lin, Lin, Yang, Yilun, Zhang, Ruizhe

Sommario: “...-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach...”
Testo

Settling Time vs. Accuracy Tradeoffs for Clustering Big Data di Draganov, Andrew, Saulpic, David, Schwiegelshohn, Chris

Sommario: “... for effective clustering regardless of data size. Our code is publicly available and has scripts to recreate...”
Testo

Cycle Basis Algorithms for Reducing Maximum Edge Participation di Wang, Fan, Irani, Sandy

Sommario: “... quantum codes. We further analyze a simplified balls-into-bins process to establish lower bounds on edge...”
Testo

Invertible Bloom Lookup Tables with Less Memory and Randomness di Fleischhacker, Nils, Larsen, Kasper Green, Obremski, Maciej, Simkin, Mark

Sommario: “..., error-correcting codes, and even the design of advanced cryptographic primitives. For storing $n...”
Testo

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space di Sajith, Thejas Radhika

Sommario: “... both the time and space usage. Notably, Bringmann [SODA 2017] uses a two-step color-coding technique...”
Testo

Graph-based method for constructing consensus trees di Torquet, Elio, Jansson, Jesper, Tahiri, Nadia

Sommario: “... and implementation:} The source code of PrimConsTree is freely available on GitHub at https://github.com/tahiri-lab...”
Testo

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic di Mao, Songtao

Sommario: “... approach combines a refined second-moment analysis with color coding and dynamic programming for structured...”
Testo