
SublinearTime Algorithms for Computing Embedding Gap Edit Distance
In this paper, we design new sublineartime algorithms for solving the g...
read it

Efficient and Effective ER with Progressive Blocking
Blocking is a mechanism to improve the efficiency of Entity Resolution (...
read it

Sublinear Algorithms for Gap Edit Distance
The edit distance is a way of quantifying how similar two strings are to...
read it

Correlation Clustering with SameCluster Queries Bounded by Optimal Cost
Several clustering frameworks with interactive (semisupervised) queries...
read it

MinMax Correlation Clustering via MultiCut
Correlation clustering is a fundamental combinatorial optimization probl...
read it

Paper Matching with Local Fairness Constraints
Automatically matching reviewers to papers is a crucial step of the peer...
read it

Connectivity in Random Annulus Graphs and the Geometric Block Model
Random geometric graphs are the simplest, and perhaps the earliest possi...
read it

Fully Dynamic Set Cover  Improved and Simple
In this paper, we revisit the unweighted set cover problem in the fully ...
read it

The Geometric Block Model
To capture the inherent geometric features of many community detection p...
read it

Query Complexity of Clustering with Side Information
Suppose, we are given a set of n elements to be clustered into k (unknow...
read it

Clustering with Noisy Queries
In this paper, we initiate a rigorous theoretical study of clustering wi...
read it

A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution
Entity resolution (ER) is the task of identifying all records in a datab...
read it
Barna Saha
is this you? claim profile