1 citations · 1 across the 9 of their papers we have counts for
10 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…
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…
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…
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…
Combinatorial upper bounds for the smallest eigenvalue of a graph
Aryan Esmailpour, Sara Saeedi Madani, Dariush Kiani
Let be a graph, and let denote the smallest eigenvalue of . First, we provide an upper bound for based on induced bipartite subgraphs of . Consequently, we…
Range (Rényi) Entropy Queries and Partitioning
Aryan Esmailpour, Sanjay Krishnan, Stavros Sintos
Data partitioning that maximizes/minimizes the Shannon entropy, or more generally the Rényi entropy is a crucial subroutine in data compression, columnar storage, and cardinality e…