Large language models excel in many human-language tasks but often falte...
Karger (STOC 1995) gave the first FPTAS for the network (un)reliability
...
With the growth in capabilities of generative models, there has been gro...
In this work, we propose a zero-shot voice conversion method using speec...
From smoothly pursuing moving objects to rapidly shifting gazes during v...
We give an almost-linear time algorithm for the Steiner connectivity
aug...
In the Set Cover problem, we are given a set system with each set having...
We study the complexity of the classic capacitated k-median and k-means
...
Developers are increasingly using function-as-a-service (FaaS) platforms...
We give an Õ(m)-time algorithm for the edge connectivity
augmentation pr...
This paper presents near-optimal deterministic parallel and distributed
...
In this paper, we introduce a robust notion of (1+ϵ)-approximate
(s, t)-...
We show how to round any half-integral solution to the subtour-eliminati...
We give an algorithm to find a minimum cut in an edge-weighted directed ...
In 1961, Gomory and Hu showed that the max-flow values of all n 2
pairs ...
In the minimum k-cut problem, we want to find the minimum number of edge...
We give an algorithm for augmenting the edge connectivity of an undirect...
The Gomory-Hu tree or cut tree (Gomory and Hu, 1961) is a classic data
s...
We give a deterministic algorithm for finding the minimum (weight) cut o...
Training neural text-to-speech (TTS) models for a new speaker typically
...
Toxic online speech has become a crucial problem nowadays due to an
expo...
We present a deterministic (global) mincut algorithm for weighted, undir...
We give an n^2+o(1)-time algorithm for finding s-t min-cuts for all
pair...
In this note, we study the expander decomposition problem in a more gene...
The (non-uniform) sparsest cut problem is the following graph-partitioni...
We give an algorithm to find a mincut in an n-vertex, m-edge weighted
di...
We study how to vertex-sparsify a graph while preserving both the graph'...
The vertex connectivity of an m-edge n-vertex undirected graph is the
sm...
For an unweighted graph on k terminals, Kratsch and Wahlström constructe...
Many data we collect today are in tabular form, with rows as records and...
In the k-cut problem, we want to find the smallest set of edges whose
de...
We explore novel approaches to the task of image generation from their
r...
We develop a new approach for distributed distance computation in planar...
In the k-cut problem, we are given an edge-weighted graph and want to fi...
We present the first m polylog(n) work, polylog(n) time
algorithm in the...
Mellotron is a multispeaker voice synthesis model based on Tacotron 2 GS...
We consider the classical Minimum Balanced Cut problem: given a graph G,...
We study deterministic algorithms for computing graph cuts, with focus o...
We consider the (exact, minimum) k-cut problem: given a graph and an
int...
NeMo (Neural Modules) is a Python framework-agnostic toolkit for creatin...
In the Feedback Vertex Set problem, one is given an undirected graph G a...
Given an edge-weighted graph, how many minimum k-cuts can it have? This ...
We propose NovoGrad, a first-order stochastic gradient method with layer...
We investigate the fine-grained complexity of approximating the classica...
In this paper, we report state-of-the-art results on LibriSpeech among
e...
Building an accurate automatic speech recognition (ASR) system requires ...
In the k-cut problem, we are given an edge-weighted graph G and an
integ...
Of all the restricted graph families out there, the family of low treewi...
We consider the online problem of minimizing weighted flow-time on unrel...
The Congested Clique model of distributed computing, which was introduce...