research
∙
09/12/2023
AstroLLaMA: Towards Specialized Foundation Models in Astronomy
Large language models excel in many human-language tasks but often falte...
share
research
∙
04/13/2023
Beyond the Quadratic Time Barrier for Network Unreliability
Karger (STOC 1995) gave the first FPTAS for the network (un)reliability ...
research
∙
04/12/2023
NutritionVerse-Thin: An Optimized Strategy for Enabling Improved Rendering of 3D Thin Food Models
With the growth in capabilities of generative models, there has been gro...
research
∙
02/16/2023
ACE-VC: Adaptive and Controllable Voice Conversion using Explicitly Disentangled Self-supervised Speech Representations
In this work, we propose a zero-shot voice conversion method using speec...
research
∙
12/20/2022
Modeling Human Eye Movements with Neural Networks in a Maze-Solving Task
From smoothly pursuing moving objects to rapidly shifting gazes during v...
research
∙
11/10/2022
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows
We give an almost-linear time algorithm for the Steiner connectivity aug...
research
∙
11/08/2022
A Local Search-Based Approach for Set Covering
In the Set Cover problem, we are given a set system with each set having...
research
∙
08/30/2022
On the Fixed-Parameter Tractability of Capacitated Clustering
We study the complexity of the classic capacitated k-median and k-means ...
research
∙
08/27/2022
Apiary: A DBMS-Backed Transactional Function-as-a-Service Framework
Developers are increasingly using function-as-a-service (FaaS) platforms...
research
∙
05/10/2022
Edge Connectivity Augmentation in Near-Linear Time
We give an Õ(m)-time algorithm for the edge connectivity augmentation pr...
research
∙
04/12/2022
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel Distributed Algorithms
This paper presents near-optimal deterministic parallel and distributed ...
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
Matroid-Based TSP Rounding for Half-Integral Solutions
We show how to round any half-integral solution to the subtour-eliminati...
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/05/2021
Breaking the n^k Barrier for Minimum k-cut on Simple Graphs
In the minimum k-cut problem, we want to find the minimum number of edge...
research
∙
11/03/2021
Augmenting Edge Connectivity via Isolating Cuts
We give an algorithm for augmenting the edge connectivity of an undirect...
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
∙
10/12/2021
Adapting TTS models For New Speakers using Transfer Learning
Training neural text-to-speech (TTS) models for a new speaker typically ...
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
∙
06/10/2021
Deterministic Mincut in Almost-Linear Time
We present a deterministic (global) mincut algorithm for weighted, undir...
research
∙
06/04/2021
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs
We give an n^2+o(1)-time algorithm for finding s-t min-cuts for all pair...
research
∙
06/03/2021
Deterministic Weighted Expander Decomposition in Almost-linear Time
In this note, we study the expander decomposition problem in a more gene...
research
∙
05/31/2021
A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut
The (non-uniform) sparsest cut problem is the following graph-partitioni...
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
∙
04/01/2021
O(1) Steiner Point Removal in Series-Parallel Graphs
We study how to vertex-sparsify a graph while preserving both the graph'...
research
∙
03/31/2021
Vertex Connectivity in Poly-logarithmic Max-flows
The vertex connectivity of an m-edge n-vertex undirected graph is the sm...
research
∙
11/26/2020
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs
For an unweighted graph on k terminals, Kratsch and Wahlström constructe...
research
∙
09/07/2020
A Lightweight Algorithm to Uncover Deep Relationships in Data Tables
Many data we collect today are in tabular form, with rows as records and...
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
∙
12/24/2019
Planar Diameter via Metric Compression
We develop a new approach for distributed distance computation in planar...
research
∙
11/20/2019
The Karger-Stein Algorithm is Optimal for k-cut
In the k-cut problem, we are given an edge-weighted graph and want to fi...
research
∙
11/05/2019
Faster Parallel Algorithm for Approximate Shortest Path
We present the first m polylog(n) work, polylog(n) time algorithm in the...
research
∙
10/26/2019
Mellotron: Multispeaker expressive voice synthesis by conditioning on rhythm, pitch and global style tokens
Mellotron is a multispeaker voice synthesis model based on Tacotron 2 GS...
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
∙
10/17/2019
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
We study deterministic algorithms for computing graph cuts, with focus o...
research
∙
10/07/2019
Faster Minimum k-cut of a Simple Graph
We consider the (exact, minimum) k-cut problem: given a graph and an int...
research
∙
09/14/2019
NeMo: a toolkit for building AI applications using Neural Modules
NeMo (Neural Modules) is a Python framework-agnostic toolkit for creatin...
research
∙
06/28/2019
Detecting Feedback Vertex Sets of Size k in O^(2.7^k) Time
In the Feedback Vertex Set problem, one is given an undirected graph G a...
research
∙
06/02/2019
The Number of Minimum k-Cuts: Improving the Karger-Stein Bound
Given an edge-weighted graph, how many minimum k-cuts can it have? This ...
research
∙
05/27/2019
Stochastic Gradient Methods with Layer-wise Adaptive Moments for Training of Deep Networks
We propose NovoGrad, a first-order stochastic gradient method with layer...
research
∙
04/28/2019
Tight FPT Approximations for k-Median and k-Means
We investigate the fine-grained complexity of approximating the classica...
research
∙
04/05/2019
Jasper: An End-to-End Convolutional Neural Acoustic Model
In this paper, we report state-of-the-art results on LibriSpeech among e...
research
∙
11/02/2018
Training Neural Speech Recognition Systems with Synthetic Speech Augmentation
Building an accurate automatic speech recognition (ASR) system requires ...
research
∙
07/21/2018
Faster Exact and Approximate Algorithms for k-Cut
In the k-cut problem, we are given an edge-weighted graph G and an integ...
research
∙
05/27/2018
Distributed Treewidth Computation
Of all the restricted graph families out there, the family of low treewi...
research
∙
05/24/2018
Non-Preemptive Flow-Time Minimization via Rejections
We consider the online problem of minimizing weighted flow-time on unrel...
research
∙
05/18/2018
