research
∙
08/27/2022
Apiary: A DBMS-Backed Transactional Function-as-a-Service Framework
Developers are increasingly using function-as-a-service (FaaS) platforms...
share
research
∙
03/01/2022
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time
In this paper, we introduce a robust notion of (1+ϵ)-approximate (s, t)-...
research
∙
11/17/2021
Minimum Cuts in Directed Graphs via Partial Sparsification
We give an algorithm to find a minimum cut in an edge-weighted directed ...
research
∙
11/09/2021
Gomory-Hu Tree in Subcubic Time
In 1961, Gomory and Hu showed that the max-flow values of all n 2 pairs ...
research
∙
11/03/2021
Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows
The Gomory-Hu tree or cut tree (Gomory and Hu, 1961) is a classic data s...
research
∙
11/03/2021
Deterministic Min-cut in Poly-logarithmic Max-flows
We give a deterministic algorithm for finding the minimum (weight) cut o...
research
∙
08/06/2021
Offensive Language and Hate Speech Detection with Deep Learning and Transfer Learning
Toxic online speech has become a crucial problem nowadays due to an expo...
research
∙
04/16/2021
Minimum Cuts in Directed Graphs via √(n) Max-Flows
We give an algorithm to find a mincut in an n-vertex, m-edge weighted di...
research
∙
05/17/2020
Optimal Bounds for the k-cut Problem
In the k-cut problem, we want to find the smallest set of edges whose de...
research
∙
03/26/2020
Cycle Text-To-Image GAN with BERT
We explore novel approaches to the task of image generation from their r...
research
∙
10/17/2019
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
We consider the classical Minimum Balanced Cut problem: given a graph G,...
research
∙
05/18/2018
