research
∙
10/21/2020
A Note on the Approximability of Deepest-Descent Circuit Steps
Linear programs (LPs) can be solved through a polynomial number of so-ca...
share
research
∙
10/16/2019
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter
The discrete Wasserstein barycenter problem is a minimum-cost mass trans...
research
∙
04/10/2019
Constructing Clustering Transformations
Clustering is one of the fundamental tasks in data analytics and machine...
research
∙
08/19/2013
A balanced k-means algorithm for weighted point sets
The classical k-means algorithm for partitioning n points in R^d into k ...
research
∙
07/15/2013
