This article discusses improving sketching algorithms through innovative machine learning techniques.
― 5 min read
Computer Science - Data Structures and Algorithms
RSSExploring 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
Learned indexing improves data retrieval speed using machine learning techniques.
― 6 min read
New methods improve efficiency in bin packing and hypergraph coloring applications.
― 6 min read
Learn how cuckoo hashing enhances data storage and privacy in cryptographic applications.
― 4 min read
This article discusses methods to find missing subgraphs in larger graphs.
― 4 min read
A method for maintaining large matchings in frequently updated graphs.
― 4 min read
Research unveils methods to test if crease patterns can be folded flat.
― 5 min read
This study investigates how negative feedback can enhance graph traversal efficiency.
― 5 min read
Investigating the isomorphism problem in power graphs and its implications.
― 6 min read
A new deterministic algorithm for (degree + 1)-list coloring in distributed systems.
― 5 min read
A new method to handle interactions in temporal graphs effectively.
― 4 min read
New graph structures improve the study of genomic diversity and data processing.
― 6 min read
Exploring page counts in deque and rique layouts for complete graphs.
― 5 min read
Learn how synthetic data can protect privacy in longitudinal research.
― 7 min read
Learn how Pb-Hash improves data management and efficiency in various fields.
― 5 min read
Explore methods to minimize machine rentals while scheduling tasks effectively.
― 5 min read
A look at the clarity and structure of axis-parallel RAC graphs.
― 7 min read
New algorithms improve efficiency in approximating treewidth for complex graph issues.
― 6 min read
Exploring how quantum computing can address vehicle routing problems with time constraints.
― 5 min read
This work introduces new rules for graph editing to achieve trivially perfect structures.
― 5 min read
Learn how DP-OPH techniques safeguard user data in analytics.
― 5 min read
A new technique improves the search for genetic sequences in large datasets.
― 6 min read
A new method for identifying maximum cliques in complex networks.
― 6 min read
This article explores Noise Stability Optimization to enhance neural network generalization.
― 6 min read
A new method for quickly identifying k-edge-connected subgraphs in large graphs.
― 5 min read
A look into the complexities and solutions for ECC and VCC problems.
― 5 min read
A new algorithm improves responsiveness in dynamic online scenarios.
― 5 min read
HashMem speeds up hashmaps by combining processing and memory.
― 6 min read
Learn about faster methods for measuring string similarity using edit distance.
― 4 min read