Learn how differential privacy enhances data analysis while safeguarding personal information.
Erzhi Liu, Jerry Yao-Chieh Hu, Alex Reneau
― 5 min read
Computer Science - Data Structures and Algorithms
RSSLearn how adjacency labeling optimizes graph data storage and analysis.
Édouard Bonnet, Julien Duron, John Sylvester
― 6 min read
Oblivious data structures protect sensitive information by hiding access patterns.
Thore Thießen, Jan Vahrenhold
― 5 min read
An overview of joint embedding property and its implications for cographs and trees.
Daniel Carter
― 5 min read
Examining how improvements in decision trees can enhance coding theory methods.
Caleb Koch, Carmen Strassle, Li-Yang Tan
― 5 min read
A study on dynamic issues in unit disk graphs and efficient problem-solving methods.
Shinwoo An, Kyungjin Cho, Leo Jang
― 6 min read
A look at flow decomposition's role in RNA assembly and its advancements.
Bashar Ahmed, Siddharth Singh Rana, Ujjwal
― 5 min read
New methods enhance efficiency in sampling log-concave distributions within polytopes.
Oren Mangoubi, Nisheeth K. Vishnoi
― 5 min read
This paper discusses fairness in selecting candidates for institutions amid biased evaluations.
L. Elisa Celis, Amit Kumar, Nisheeth K. Vishnoi
― 7 min read
Learn how covers enhance efficiency in string processing and analysis.
Jakub Radoszewski, Wiktor Zuba
― 5 min read
This research explores efficient learning of Markov Random Fields using dynamic samples.
Jason Gaitonde, Ankur Moitra, Elchanan Mossel
― 6 min read
A novel compressor boosts GMRES performance in solving linear equations.
Thomas Grützmacher, Robert Underwood, Sheng Di
― 6 min read
Silq simplifies quantum programming with user-friendly features.
Viktorija Bezganovic, Marco Lewis, Sadegh Soudjani
― 6 min read
Investigating how vertex merging impacts graph properties and classifications.
Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
― 6 min read
Examining dynamic pricing strategies for efficient resource allocation.
Max Bender, Aum Desai, Jialin He
― 5 min read
Gabow's algorithm efficiently finds maximum matchings in general graphs.
Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn
― 3 min read
Exploring various types and applications of matching problems in different fields.
Gergely Csáji
― 5 min read
This study examines minimum spanning trees with uncertain edge weights from single samples.
Ruben Hoeksma, Gavin Speek, Marc Uetz
― 4 min read
Researchers tackled real-world data search challenges at NeurIPS 2023.
Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber
― 6 min read
A new method for faster string query evaluation using MSO logic.
Pierre Bourhis, Florent Capelli, Stefan Mengel
― 4 min read
A new method for counting cycles in graphs while ensuring user privacy.
Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya
― 6 min read
Discover new methods for representing Baxter permutations with improved space efficiency.
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim
― 4 min read
New methods for efficiently analyzing network changes in weighted graphs.
Koustav Bhanja
― 7 min read
An overview of temporal forests and their significance in tracking changing connections.
Davide Bilò, Luciano Gualà, Stefano Leucci
― 6 min read
Examining methods to optimize sparse matrix-vector multiplications for energy savings.
Francesco Tosoni, Philip Bille, Valerio Brunacci
― 7 min read
New algorithms improve clustering in relational databases without prior data joins.
Aryan Esmailpour, Stavros Sintos
― 5 min read
Discovering largest -biplexes using FastMVBP algorithm enhances graph data analysis.
Zhenxiang Xu, Yiping Liu, Yi Zhou
― 4 min read
New algorithms improve solving integer equations critical for cryptography.
Mayank Deora, Pinakpani Pal
― 5 min read
A look into clustered planarity and linear saturation in graph representation.
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta
― 5 min read
New methods enhance counting shapes in directed graphs, improving speed and accuracy.
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams
― 8 min read
Examining how simple robots can form specific patterns while maintaining symmetry.
Raphael Gerlach, Sören von der Gracht, Christopher Hahn
― 6 min read
A new algorithm enhances convex hull finding with improved efficiency.
Michael T. Goodrich, Ryuto Kitagawa
― 4 min read
This article explores smooth boosting and its advantages in model training.
Guy Blanc, Alexandre Hayderi, Caleb Koch
― 6 min read
A look into the challenges and advancements in Minimum Flow Decomposition.
Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey
― 5 min read
GASM combines graph structure and attributes for improved matching solutions.
Raphaël Candelier
― 7 min read
New algorithms improve efficiency in hypergraph tree decompositions.
Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh
― 5 min read
New methods for identifying graph structure improve accuracy and efficiency.
Sourav Dutta, Arnab Bhattacharya
― 4 min read
A study on the drawing and properties of abstract topological graphs.
Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani
― 6 min read
A simple guide to graphs, nodes, edges, and distances in real life.
R. Arnau, J. M. Calabuig, L. M. García Raffi
― 5 min read
Exploring the integration of deep learning with Bayesian methods to improve data estimation.
Aayush Karan, Kulin Shah, Sitan Chen
― 7 min read