Risultati della ricerca - coding Algorithm

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

Efficiency of ANS Entropy Encoders di Kosolobov, Dmitry

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

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

Sommario: “... to solve via a surprisingly simple color-coding algorithm, which relies on identifying an insightful...”
Testo

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

Sommario: “... and by a factor of 1.56 x compared to the method implemented in RecJPQ code on a large-scale Gowalla...”
Testo

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

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

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

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

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

Sommario: “... powerful tool with applications in functional analysis, communication complexity, coding theory...”
Testo

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

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

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

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

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

Sommario: “... pipeline of large language models orchestrated by an evolutionary coding agent. A matrix multiplication...”
Testo

Monte-Carlo modeling for evaluation of two different calculation algorithms di Baljeet Seniwal

Sommario: “... Algorithm Dimensional Conformal Radiation Therapy Modeling of linac head (VARIAN Trilogy) for 6 MeV photon...”
Testo

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

Sommario: “...Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low...”
Testo

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

Sommario: “...Traditional error-correcting codes (ECCs) assume a fixed message length, but many scenarios involve...”
Testo

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

Sommario: “...We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically...”
Testo

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

Sommario: “...In this paper, we prove that with high probability, random Reed-Solomon codes approach the half...”
Testo