Suchergebnisse - coding (Algorithm OR Algorithmic)

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

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

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

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

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

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

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

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

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

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

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

Inhaltsangabe: “… approach combines a refined second-moment analysis with color coding and dynamic programming for structured …”
Volltext

Efficiency of ANS Entropy Encoders von Kosolobov, Dmitry

Inhaltsangabe: “… on the data compression, substituting arithmetic and Huffman coding. It was studied by different authors …”
Volltext

Parameterized Maximum Node-Disjoint Paths von Lampis, Michael, Vasilakis, Manolis

Inhaltsangabe: “… to solve via a surprisingly simple color-coding algorithm, which relies on identifying an insightful …”
Volltext

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items von Petrov, Aleksandr V., Macdonald, Craig, Tonellotto, Nicola

Inhaltsangabe: “… and by a factor of 1.56 x compared to the method implemented in RecJPQ code on a large-scale Gowalla …”
Volltext

Bipartite Matching is in Catalytic Logspace von Agarwala, Aryan, Mertz, Ian

Inhaltsangabe: “… coding problem for $NC$ circuits ($LOSSY[NC]$). This has consequences for matching, catalytic space …”
Volltext

Near-Optimal Averaging Samplers and Matrix Samplers von Xun, Zhiyang, Zuckerman, David

Inhaltsangabe: “… and list-decodable codes to give applications to these objects. Specifically, we give the first extractor …”
Volltext

Radial Isotropic Position via an Implicit Newton's Method von Jambulapati, Arun, Li, Jonathan, Tian, Kevin

Inhaltsangabe: “… powerful tool with applications in functional analysis, communication complexity, coding theory …”
Volltext

Knapsack on Graphs with Relaxed Neighborhood Constraints von Dey, Palash, Hota, Ashlesha, Kolay, Sudeshna

Inhaltsangabe: “… $ and also parameterized by solution size, $b$. For \sor and \hor, we present a randomized color-coding-based …”
Volltext

Computing Diverse and Nice Triangulations von Gálvez, Waldo, Goswami, Mayank, Merino, Arturo, Park, GiBeom, Tsai, Meng-Tsung

Inhaltsangabe: “… < j} d(T_i,T_j) $, we show a reduction from the problem of computing optimal Hamming codes …”
Volltext

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications von Dumas, Jean-Guillaume, Pernet, Clément, Sedoglavic, Alexandre

Inhaltsangabe: “… pipeline of large language models orchestrated by an evolutionary coding agent. A matrix multiplication …”
Volltext

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets von Alrabiah, Omar, Guo, Zeyu, Guruswami, Venkatesan, Li, Ray, Zhang, Zihan

Inhaltsangabe: “… Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low …”
Volltext

Unbounded Error Correcting Codes von Efremenko, Klim, Zamir, Or

Inhaltsangabe: “… Traditional error-correcting codes (ECCs) assume a fixed message length, but many scenarios involve …”
Volltext

Improved Explicit Near-Optimal Codes in the High-Noise Regimes von Li, Xin, Mao, Songtao

Inhaltsangabe: “… We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically …”
Volltext

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets von Con, Roni, Guo, Zeyu, Li, Ray, Zhang, Zihan

Inhaltsangabe: “… In this paper, we prove that with high probability, random Reed-Solomon codes approach the half …”
Volltext

Greedy Gray Codes for some Restricted Classes of Binary Words von Hassler, Nathanaël, Vajnovszki, Vincent, Wong, Dennis

Inhaltsangabe: “… We investigate the existence of greedy Gray codes, based on the choice of the first element …”
Volltext