Spremljaj
Melanie Schmidt
Melanie Schmidt
Preverjeni e-poštni naslov na hhu.de
Naslov
Navedeno
Navedeno
Leto
Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
D Feldman, M Schmidt, C Sohler
SODA 2013, 1434-1453, 2013
644*2013
Fair Coresets and Streaming Algorithms for Fair k-means
M Schmidt, C Schwiegelshohn, C Sohler
International Workshop on Approximation and Online Algorithms, 232-251, 2019
161*2019
Privacy preserving clustering with constraints
C Rösner, M Schmidt
ICALP 2018, also: arXiv preprint arXiv:1802.02497, 2018
1382018
Theoretical Analysis of the k-Means Algorithm–A Survey
J Blömer, C Lammersen, M Schmidt, C Sohler
Algorithm Engineering, 81-116, 2016
1282016
On the cost of essentially fair clusterings
IO Bercea, M Groß, S Khuller, A Kumar, C Rösner, DR Schmidt, ...
arXiv preprint arXiv:1811.10319, 2018
1202018
Improved and simplified inapproximability for k-means
E Lee, M Schmidt, J Wright
Information Processing Letters 120, 40-43, 2017
1122017
BICO: BIRCH meets coresets for k-means clustering
H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler
European Symposium on Algorithms, 481-492, 2013
952013
On the use of network flow techniques for assigning evacuees to exits
D Dressler, M Groß, JP Kappmeier, T Kelter, J Kulbatzki, D Plümpe, ...
Procedia Engineering 3, 205-215, 2010
472010
Earliest arrival flows in networks with multiple sinks
M Schmidt, M Skutella
Discrete Applied Mathematics 164, 320-327, 2014
39*2014
Analysis of Ward's method
A Großwendt, H Röglin, M Schmidt
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
372019
Approximating Earliest Arrival Flows in Arbitrary Networks
M Groß, JP Kappmeier, D Schmidt, M Schmidt
ESA 2012, 551-562, 2012
272012
Probabilistic k-Median Clustering in Data Streams
C Lammersen, M Schmidt, C Sohler
WAOA 2012 / Technical Report 2011, 2011
25*2011
Sublinear data structures for short Fréchet queries
A Driemel, I Psarros, M Schmidt
arXiv preprint arXiv:1907.04420, 2019
162019
Noisy, Greedy and Not So Greedy k-means++
A Bhattacharya, J Eube, H Röglin, M Schmidt
ESA 2020, arXiv preprint arXiv:1912.00653, 2019
152019
A Local-Search Algorithm for Steiner Forest
J Matuschke, M Groß, A Gupta, A Kumar, DR Schmidt, M Schmidt, ...
ITCS 2018, Leibniz International Proceedings in Informatics, 31: 1-31: 17, 2018
15*2018
Fully dynamic hierarchical diameter k-clustering and k-center
M Schmidt, C Sohler
arXiv preprint arXiv:1908.02645, 2019
102019
Coresets and streaming algorithms for the k-means problem and related clustering objectives
M Schmidt
TU Dortmund, 2014
102014
Achieving anonymity via weak lower bound constraints for k-median and k-means
A Arutyunova, M Schmidt
STACS 2021, arXiv preprint arXiv:2009.03078, 2020
92020
Approximation algorithms for aversion k-clustering via local k-median
A Gupta, G Guruganesh, M Schmidt
ICALP 2016, 2016
92016
Solving k-means on High-dimensional Big Data
JPW Kappmeier, DR Schmidt, M Schmidt
Experimental Algorithms, also arXiv preprint arXiv:1502.04265, 2015/2/15 …, 2015
52015
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20