1 citations · 1 across the 8 of their papers we have counts for
6 papers · 1 filter
Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
Nima Shahbazi, Aryan Esmailpour, Stavros Sintos
The weighted set multi-cover problem is a fundamental generalization of set cover that arises in data-driven applications where one must select a small, low-cost subset from a larg…
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…
Subset Sampling over Joins
Aryan Esmailpour, Xiao Hu, Jinchao Huang +1
Subset sampling (also known as Poisson sampling), where the decision to include any specific element in the sample is made independently of all others, is a fundamental primitive i…
Space-Time Tradeoffs for Spatial Conjunctive Queries
Aryan Esmailpour, Xiao Hu, Stavros Sintos
Given a conjunctive query and a database instance, we aim to develop an index that can efficiently answer spatial queries on the results of a conjunctive query. We are interested i…
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…