1 citations · 1 across the 9 of their papers we have counts for
4 papers · 1 filter
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…