Barna Saha

is this you? claim profile

0 followers
University of Massachusetts Amherst ∙ berkeley college

Sublinear-Time Algorithms for Computing Embedding Gap Edit Distance

In this paper, we design new sublinear-time algorithms for solving the g...
07/24/2020 ∙ by Tomasz Kociumaka, et al. ∙ 0 ∙ share

read it
Efficient and Effective ER with Progressive Blocking

Blocking is a mechanism to improve the efficiency of Entity Resolution (...
05/28/2020 ∙ by Sainyam Galhotra, et al. ∙ 0 ∙ share

read it
Sublinear Algorithms for Gap Edit Distance

The edit distance is a way of quantifying how similar two strings are to...
10/02/2019 ∙ by Elazar Goldenberg, et al. ∙ 0 ∙ share

read it
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost

Several clustering frameworks with interactive (semi-supervised) queries...
08/14/2019 ∙ by Barna Saha, et al. ∙ 0 ∙ share

read it
Min-Max Correlation Clustering via MultiCut

Correlation clustering is a fundamental combinatorial optimization probl...
06/28/2019 ∙ by Saba Ahmadi, et al. ∙ 0 ∙ share

read it
Paper Matching with Local Fairness Constraints

Automatically matching reviewers to papers is a crucial step of the peer...
05/28/2019 ∙ by Ari Kobren, et al. ∙ 0 ∙ share

read it
Connectivity in Random Annulus Graphs and the Geometric Block Model

Random geometric graphs are the simplest, and perhaps the earliest possi...
04/12/2018 ∙ by Sainyam Galhotra, et al. ∙ 0 ∙ share

read it
Fully Dynamic Set Cover -- Improved and Simple

In this paper, we revisit the unweighted set cover problem in the fully ...
04/09/2018 ∙ by Raghavendra Addanki, et al. ∙ 0 ∙ share

read it
The Geometric Block Model

To capture the inherent geometric features of many community detection p...
09/16/2017 ∙ by Sainyam Galhotra, et al. ∙ 0 ∙ share

read it
Query Complexity of Clustering with Side Information

Suppose, we are given a set of n elements to be clustered into k (unknow...
06/23/2017 ∙ by Arya Mazumdar, et al. ∙ 0 ∙ share

read it
Clustering with Noisy Queries

In this paper, we initiate a rigorous theoretical study of clustering wi...
06/22/2017 ∙ by Arya Mazumdar, et al. ∙ 0 ∙ share

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...
02/03/2017 ∙ by Arya Mazumdar, et al. ∙ 0 ∙ share

read it

Barna Saha

Featured Co-authors

Andrew McCallum

Tomasz Kociumaka

Robert Krauthgamer

Arya Mazumdar

Roy Schwartz

Divesh Srivastava

Soumyabrata Pal

Sainyam Galhotra

Sanjay Subramanian

Ari Kobren

Samir Khuller

Sublinear-Time Algorithms for Computing Embedding Gap Edit Distance

Efficient and Effective ER with Progressive Blocking

Sublinear Algorithms for Gap Edit Distance

Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost

Min-Max Correlation Clustering via MultiCut

Paper Matching with Local Fairness Constraints

Connectivity in Random Annulus Graphs and the Geometric Block Model

Fully Dynamic Set Cover -- Improved and Simple

The Geometric Block Model

Query Complexity of Clustering with Side Information

Clustering with Noisy Queries

A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution