7 papers
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…
Clustering with Set Outliers and Applications in Relational Clustering
Vaishali Surianarayanan, Neeraj Kumar, Stavros Sintos
We introduce and study the -center clustering problem with set outliers, a natural and practical generalization of the classical -center clustering with outliers. Instead of…
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…
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…
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…
Fast Approximation Algorithms for Piercing Boxes by Points
Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury +1
$\newcommand{\popt}{\mathcal{p}} \newcommand{\Re}{\mathbb{R}}\newcommand{\N}{\mathcal{N}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon}…