The recognition of information in floor plan data requires the use of
de...
For prohibitively large-scale Travelling Salesman Problems (TSPs), exist...
We consider the problem of subset selection where one is given multiple
...
We consider the problem of constructing small coresets for k-Median in
E...
We study the power of uniform sampling for k-Median in various metric
sp...
We study coresets for clustering with capacity and fairness constraints....
Designing small-sized coresets, which approximately preserve the costs
o...
Constructing small-sized coresets for various clustering problems in
Euc...
Vertical federated learning (VFL), where data features are stored in mul...
The problem of monotone submodular maximization has been studied extensi...
We consider robust clustering problems in ℝ^d, specifically
k-clustering...
We study the problem of constructing coresets for clustering problems wi...
In data containing heterogeneous subpopulations, classification performa...
This paper introduces the problem of coresets for regression problems to...
Due to the growing deployment of classification algorithms in various so...
Given a collection of n points in ℝ^d, the goal of the
(k,z)-clustering ...
We initiate the study of coresets for clustering in graph metrics, i.e.,...
In a recent work, Chierichetti et al. studied the following "fair" varia...
Fair classification has been a topic of intense study in machine learnin...
Developing classification algorithms that are fair with respect to sensi...
We study the problem of constructing ε-coresets for the (k,
z)-clusterin...
We study multiwinner voting problems when there is an additional require...
Support Vector Machine is one of the most classical approaches for
class...