Search Results for author: Karl Bringmann

Found 6 papers, 0 papers with code

Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation

no code implementations19 Jan 2021 Karl Bringmann, André Nusser

Computing the similarity of two point sets is a ubiquitous task in medical imaging, geometric shape comparison, trajectory analysis, and many more settings.

Computational Geometry Computational Complexity

Impossibility Results for Grammar-Compressed Linear Algebra

no code implementations NeurIPS 2020 Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann

In this paper we consider lossless compression schemes, and ask if we can run our computations on the compressed data as efficiently as if the original data was that small.

A PTAS for $\ell_p$-Low Rank Approximation

no code implementations16 Jul 2018 Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff

On the algorithmic side, for $p \in (0, 2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$.

Maximum Volume Subset Selection for Anchored Boxes

no code implementations2 Mar 2018 Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich

It is known that the problem can be solved in polynomial time in the plane, while the best known running time in any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$.

Computational Geometry Data Structures and Algorithms F.2.2

Cannot find the paper you are looking for? You can Submit a new open access paper.