research
∙
03/21/2023
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
In fully dynamic clustering problems, a clustering of a given data set i...
share
research
∙
02/25/2023
Agile Modeling: Image Classification with Domain Experts in the Loop
Machine learning is not readily accessible to domain experts from many f...
research
∙
09/29/2022
Sequential Attention for Feature Selection
Feature selection is the problem of selecting a subset of features for a...
research
∙
05/20/2022
Tackling Provably Hard Representative Selection via Graph Neural Networks
Representative selection (RS) is the problem of finding a small subset o...
research
∙
12/13/2021
Optimal Fully Dynamic k-Centers Clustering
We present the first algorithm for fully dynamic k-centers clustering in...
research
∙
12/06/2021
On Complexity of 1-Center in Various Metrics
We consider the classic 1-center problem: Given a set P of n points in a...
research
∙
06/09/2021
Streaming Belief Propagation for Community Detection
The community detection problem requires to cluster the nodes of a netwo...
research
∙
06/05/2019
Distributed Weighted Matching via Randomized Composable Coresets
Maximum weight matching is one of the most fundamental combinatorial opt...
research
∙
04/30/2019
Categorical Feature Compression via Submodular Optimization
In the era of big data, learning from categorical features with very lar...
research
∙
11/30/2018
Fast Algorithms for Knapsack via Convolution and Prediction
The knapsack problem is a fundamental problem in combinatorial optimizat...
research
∙
11/09/2018
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
The k-cut problem asks, given a connected graph G and a positive integer...
research
∙
09/11/2018
Massively Parallel Dynamic Programming on Trees
Dynamic programming is a powerful technique that is, unfortunately, ofte...
research
∙
11/08/2017