2 citations · 3 across the 9 of their papers we have counts for
4 papers · 1 filter
Adaptive Out-Orientations with Applications
Chandra Chekuri, Aleksander Bjørn Christiansen, Jacob Holm +4
We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph, such that the out-degree of each vertex is bounded. On one hand, we show how to orient the e…
On Generalization Bounds for Projective Clustering
Maria Sofia Bucarelli, Matilde Fjeldsø Larsen, Chris Schwiegelshohn +1
Given a set of points, clustering consists of finding a partition of a point set into clusters such that the center to which a point is assigned is as close as possible. Most c…
Sparse Dimensionality Reduction Revisited
Mikael Møller Høgsgaard, Lion Kamma, Kasper Green Larsen +2
The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of points in into $m=O(\vare…
Optimally Interpolating between Ex-Ante Fairness and Welfare
Mikael Møller Høgsgaard, Panagiotis Karras, Wenyue Ma +2
For the fundamental problem of allocating a set of resources among individuals with varied preferences, the quality of an allocation relates to the degree of fairness and the colle…