Copertina

Generalized Fractional Repetition Codes for Binary Coded Computations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Charalambides, Neophytos, Mahdavifar, Hessam, Hero III, Alfred O.
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Information Theory Numerical Analysis 94B05, 68W15, 15A99 H.1.1; F.2.1; F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Iterative Sketching for Secure Coded Regression
di: Charalambides, Neophytos, et al.
Pubblicazione: (2023)

Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
di: Charalambides, Neophytos, et al.
Pubblicazione: (2026)

Gradient Coding with Iterative Block Leverage Score Sampling
di: Charalambides, Neophytos, et al.
Pubblicazione: (2023)

Distributed Hybrid Sketching for $\ell_2$-Embeddings
di: Charalambides, Neophytos, et al.
Pubblicazione: (2024)

Length 3 Check Digit Codes with Grouped Tags and Disjoint Coding Applications
di: Dunning, Larry A.
Pubblicazione: (2023)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
di: Al-atar, Munqath, et al.
Pubblicazione: (2024)

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
di: Al-atar, Munqath, et al.
Pubblicazione: (2024)

Totally Disjoint 3-Digit Decimal Check Digit Codes
di: Dunning, Larry A.
Pubblicazione: (2025)

A Permutation-Free Length 3 Decimal Check Digit Code
di: Dunning, Larry A.
Pubblicazione: (2025)

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma
di: Mourad, Daniel
Pubblicazione: (2024)

The Quasi-probability Method and Applications for Trace Reconstruction
di: Rubinstein, Ittai
Pubblicazione: (2024)

Dorst-Smeulders Coding for Arbitrary Binary Words
di: De Luca, Alessandro, et al.
Pubblicazione: (2025)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
di: Anagnostopoulos, Theodoros, et al.
Pubblicazione: (2026)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
di: Koiran, Pascal, et al.
Pubblicazione: (2024)

Computational Complexity of Physical Counting
di: Simas, Tristan
Pubblicazione: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2023)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2021)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
di: Lela, Marko
Pubblicazione: (2025)

Parameter optimization for restarted mixed precision iterative sparse solver
di: Prolubnikov, Alexander V.
Pubblicazione: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
di: Diekert, Volker, et al.
Pubblicazione: (2019)

Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem
di: Riis, Søren
Pubblicazione: (2026)

Even Faster Kernel Matrix Linear Algebra via Density Estimation
di: Shah, Rikhav, et al.
Pubblicazione: (2025)

Computing bases in Hermite normal form of lattices of integer relations
di: Labahn, George, et al.
Pubblicazione: (2026)

A computational approach to rational summability and its applications via discrete residues
di: Arreche, Carlos E., et al.
Pubblicazione: (2025)

Computing discrete residues of rational functions
di: Arreche, Carlos E., et al.
Pubblicazione: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
di: Gabryelski, Wojciech, et al.
Pubblicazione: (2026)

Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
di: Ramakrishna, P. H. D., et al.
Pubblicazione: (2003)

A Unified Mathematical Framework for Distributed Data Fabrics: Categorical Hypergraph Models
di: Shaska, T., et al.
Pubblicazione: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

Greedy Poisson Rejection Sampling
di: Flamich, Gergely
Pubblicazione: (2023)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
di: Koiran, Pascal, et al.
Pubblicazione: (2022)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)

PTOPOFL: Privacy-Preserving Personalised Federated Learning via Persistent Homology
di: Vomo-Donfack, Kelly L, et al.
Pubblicazione: (2026)

The Compute ICE-AGE: Invariant Compute Envelope under Addressable Graph Evolution
di: Martin II, R. Jay
Pubblicazione: (2026)

Semantic-Constrained Federated Aggregation: Convergence Theory and Privacy-Utility Bounds for Knowledge-Enhanced Distributed Learning
di: Arafat, Jahidul
Pubblicazione: (2025)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
di: Riis, Søren
Pubblicazione: (2026)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
di: Bannach, Max, et al.
Pubblicazione: (2025)

PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
di: Suzuki, Kengo, et al.
Pubblicazione: (2026)