9 papers
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
Aryan Esmailpour, Khoi Le, Stavros Sintos
Bipartite graphs are a fundamental representation for relational data arising in recommendation systems, social networks, and communication graphs. A key challenge in these setting…
Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar +1
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setti…
Faster Relational Algorithms Using Geometric Data Structures
Aryan Esmailpour, Stavros Sintos
Optimization tasks over relational data, such as clustering, often suffer from the prohibitive cost of join operations, which are necessary to access the full dataset. While geomet…
Improved Approximation Algorithms for Relational Clustering
Aryan Esmailpour, Stavros Sintos
Clustering plays a crucial role in computer science, facilitating data analysis and problem-solving across numerous fields. By partitioning large datasets into meaningful groups, c…
Metric -clustering using only Weak Comparison Oracles
Rahul Raychaudhury, Aryan Esmailpour, Sainyam Galhotra +1
Clustering is a fundamental primitive in unsupervised learning. However, classical algorithms for -clustering (such as -median and -means) assume access to exact pairwise…
On Fair Epsilon Net and Geometric Hitting Set
Mohsen Dehghankar, Stavros Sintos, Abolfazl Asudeh
Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be…