New insights into Lee metric codes enhance data protection and error recovery.
― 5 min read
Computer Science - Data Structures and Algorithms
RSSA study on Hitting Set algorithms and their average performance.
― 5 min read
A look into the effectiveness and limitations of spectral clustering.
― 4 min read
Techniques to better count and sample independent sets in graphs.
― 5 min read
Exploring methods to list minimal dominating sets in graphs and hypergraphs.
― 6 min read
Analyzing stability in networks through structural balance theory and efficient algorithms.
― 5 min read
A look at ensuring reliability in auditable data structures.
― 6 min read
Learn how binary matrix factorization reduces data complexity while preserving essential information.
― 5 min read
Learn how algorithms tackle the k-MST problem efficiently.
― 5 min read
A look at the role and efficiency of dictionaries in data management.
― 4 min read
A look into the Steiner Tree problem and its applications across various fields.
― 6 min read
Learn about efficient methods for calculating Personalized PageRank Vectors in large graphs.
― 5 min read
New algorithms improve speed and efficiency in handling sparse convolution.
― 5 min read
A new algorithm efficiently updates shortest paths in changing networks.
― 6 min read
A method to limit harmful content exposure on digital platforms through graph analysis.
― 6 min read
A new method improves speed and accuracy in data searches using binary codes.
― 5 min read
Learn how to make better decisions when faced with uncertainty.
― 6 min read
A method to enhance connections between isolated groups in networks.
― 4 min read
New methods enhance the speed of genomic data analysis using SBWT and LCP array.
― 4 min read
Efficiently optimizing dynamic data under strict matroid rules.
― 7 min read
A look into the importance and methods of quantum state estimation.
― 4 min read
Exploring techniques to reduce graphs while preserving key distance relationships.
― 4 min read
Exploring the benefits of lookahead in semi-online task scheduling.
― 5 min read
Introducing an algorithm for private shortest path calculations in low tree-width graphs.
― 4 min read
New graph embeddings enhance distinction between non-isomorphic graphs in machine learning tasks.
― 5 min read
New methods improve sampling efficiency for large datasets in machine learning.
― 7 min read
New methods enhance machine learning despite data noise.
― 5 min read
Explore how merging nodes can strengthen graph connectivity in various systems.
― 5 min read
This article discusses improving sketching algorithms through innovative machine learning techniques.
― 5 min read
Exploring methods to count unique items while protecting individual privacy.
― 5 min read
A look into IBLTs and their applications in data management.
― 5 min read
Introducing a reliable method for managing dynamic trees without randomness.
― 6 min read
A new algorithm enhances hiring decisions using candidate predictions.
― 4 min read
Analyzing strategies for efficiently solving the Bin Packing Problem with various real-world scenarios.
― 5 min read
MementoHash offers efficient data distribution across nodes in cloud environments.
― 7 min read
This paper presents two new algorithms for clustering graphs with clear structures.
― 5 min read
New research reveals methods to detect and address gerrymandering using random districting plans.
― 5 min read
A study on minimizing sensor use in monitoring electrical grids.
― 6 min read
Addressing bias in rankings to ensure fair selection processes.
― 4 min read
This article explores how players compete for limited resources in congestion games.
― 5 min read