7 citations · 8 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
A Theoretical Framework for Distribution-Aware Dataset Search
Aryan Esmailpour, Sainyam Galhotra, Rahul Raychaudhury +1
Effective data discovery is a cornerstone of modern data-driven decision-making. Yet, identifying datasets with specific distributional characteristics, such as percentiles or pref…
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…
Faster Algorithms for Fair Max-Min Diversification in
Yash Kurkure, Miles Shamo, Joseph Wiseman +2
The task of extracting a diverse subset from a dataset, often referred to as maximum diversification, plays a pivotal role in various real-world applications that have far-reaching…