×

Found 23 Documents (Results 1–23)

Towards optimal lower bounds for \(k\)-median and \(k\)-means coresets. (English) Zbl 07774398

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 1038-1051 (2022).
MSC:  68Qxx

Fast and exact convex hull simplification. (English) Zbl 07799604

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 26, 17 p. (2021).
MSC:  68N30 68Qxx

Making sense of economics datasets with evolutionary coresets. (English) Zbl 1442.62729

Bucciarelli, Edgardo (ed.) et al., Decision economics: complexity of decisions and decisions for complexity. Papers based on the presentations at the international conference on decision economics, DECON 2019, Ávila, Spain, June 26–28, 2019. Cham: Springer. Adv. Intell. Syst. Comput. 1009, 162-170 (2020).
MSC:  62P20 62H30 68T05
Full Text: DOI

Accurate mapreduce algorithms for \(k\)-median and \(k\)-means in general metric spaces. (English) Zbl 07650267

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 34, 16 p. (2019).
MSC:  68Wxx

Greedy strategy works for \(k\)-center clustering with outliers and coreset construction. (English) Zbl 07525477

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 40, 16 p. (2019).
MSC:  68Wxx

Efficient algorithms for \(k\)-regret minimizing sets. (English) Zbl 1432.68112

Iliopoulos, Costas S. (ed.) et al., 16th international symposium on experimental algorithms, SEA 2017, London, UK, June 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 75, Article 7, 23 p. (2017).
MSC:  68P15 68W25

Near-optimal \(\varepsilon\)-kernel construction and related problems. (English) Zbl 1432.68483

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 10, 15 p. (2017).
MSC:  68U05 68W25

\(\varepsilon\)-kernel coresets for stochastic points. (English) Zbl 1397.68202

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 50, 18 p. (2016).
MSC:  68U05 68W25

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software