On linear-time deterministic algorithms for optimization problems in fixed dimension
By Bernard Chazelle, Jirí Matousek. 1996
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Mario Lucic
- Olivier Bachem
- Andreas Krause
- Zalán Borsos
- Mojm'ir Mutn'y
- Bernhard Schölkopf
- Yoshua Bengio
- Carlos Guestrin
Citations in the corpus
- Coresets via Bilevel Optimization for Continual Learning and Streaming (2020, methodology): “Relying on this idea, we use a variant of the merge-reduce framework of [10].”
- Practical Coreset Constructions for Machine Learning (2017, methodology): “The composition properties of strong coresets can again be leveraged by applying the merge-reduce framework [Chazelle and Matoušek, 1996]. The idea is to construct and store in memory a coreset for every block of consecutive points arriving in a stream. As soon as we have two coresets in memory we m”