22 citations · 48 across the 14 of their papers we have counts for
19 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…
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…
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…
Towards Causal Physical Error Discovery in Video Analytics Systems
Jinjin Zhao, Ted Shaowang, Stavos Sintos +1
Video analytics systems based on deep learning models are often opaque and brittle and require explanation systems to help users debug. Current model explanation system are very go…
Fair Set Cover
Mohsen Dehghankar, Rahul Raychaudhury, Stavros Sintos +1
The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in computer science is Set Co…
On Reporting Durable Patterns in Temporal Proximity Graphs
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos +1
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding du…
Computing Data Distribution from Query Selectivities
Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos +1
We are given a set , where each is a \emph{range} in , such as rectangle or ball, and denotes its \emph{se…
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…
Finding Smallest Witnesses for Conjunctive Queries
Xiao Hu, Stavros Sintos
A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and debugging, query exp…
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}…
JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing
Xi Liang, Stavros Sintos, Sanjay Krishnan
Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to internet-of-things analytics. We pres…
Dynamic Enumeration of Similarity Joins
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos +1
This paper considers enumerating answers to similarity-join queries under dynamic updates: Given two sets of points in , a metric , and a distance…
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing
Xi Liang, Stavros Sintos, Zechao Shang +1
Sample-based approximate query processing (AQP) suffers from many pitfalls such as the inability to answer very selective queries and unreliable confidence intervals when sample si…
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions
Junyang Gao, Stavros Sintos, Pankaj K. Agarwal +1
A way of finding interesting or exceptional records from instant-stamped temporal data is to consider their "durability," or, intuitively speaking, how well they compare with other…
The Maximum Exposure Problem
Neeraj Kumar, Stavros Sintos, Subhash Suri
Given a set of points and axis-aligned rectangles in the plane, a point is called \emph{exposed} if it lies outside all rectangles in . In…
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise
Stavros Sintos, Pankaj K. Agarwal, Jun Yang
We study the optimization problem of selecting numerical quantities to clean in order to fact-check claims based on such data. Oftentimes, such claims are technically correct, but…
Learning to Sample: Counting with Complex Queries
Brett Walenz, Stavros Sintos, Sudeepa Roy +1
We study the problem of efficiently estimating counts for queries involving complex filters, such as user-defined functions, or predicates involving self-joins and correlated subqu…
Efficient Algorithms for k-Regret Minimizing Sets
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos +1
A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on…