Prati
Christian Sohler
Christian Sohler
Professor for Algorithmic Data Analysis, University of Cologne
Potvrđena adresa e-pošte na uni-koeln.de
Naslov
Citirano
Citirano
Godina
Turning Big Data Into Tiny Data: Constant-Size Coresets for -Means, PCA, and Projective Clustering
D Feldman, M Schmidt, C Sohler
SIAM Journal on Computing 49 (3), 601-657, 2020
5122020
Streamkm++ a clustering algorithm for data streams
MR Ackermann, M Märtens, C Raupach, K Swierkot, C Lammersen, ...
Journal of Experimental Algorithmics (JEA) 17, 2.1-2.30, 2012
4222012
Counting triangles in data streams
LS Buriol, G Frahling, S Leonardi, A Marchetti-Spaccamela, C Sohler
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006
2992006
A PTAS for k-means clustering based on weak coresets
D Feldman, M Monemizadeh, C Sohler
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
2112007
A fast k-means implementation using coresets
G Frahling, C Sohler
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
1642006
Randomized pursuit-evasion in graphs
M Adler, H Räcke, N Sivadasan, C Sohler, B Vöcking
Combinatorics, Probability and Computing 12 (3), 225-244, 2003
1612003
Clustering for metric and nonmetric distance measures
MR Ackermann, J Blömer, C Sohler
ACM Transactions on Algorithms (TALG) 6 (4), 1-26, 2010
1602010
Coresets in dynamic geometric data streams
G Frahling, C Sohler
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1592005
Sampling in dynamic data streams and applications
G Frahling, P Indyk, C Sohler
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
1362005
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
115*2019
Every property of hyperfinite graphs is testable
I Newman, C Sohler
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1152011
Testing expansion in bounded-degree graphs
A Czumaj, C Sohler
Combinatorics, Probability and Computing 19 (5-6), 693-709, 2010
992010
Coresets and sketches for high dimensional subspace approximation problems
D Feldman, M Monemizadeh, C Sohler, DP Woodruff
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
962010
Sublinear‐time approximation algorithms for clustering via random sampling
A Czumaj, C Sohler
Random Structures & Algorithms 30 (1‐2), 226-256, 2007
87*2007
Approximating the weight of the euclidean minimum spanning tree in sublinear time
A Czumaj, F Ergün, L Fortnow, A Magen, I Newman, R Rubinfeld, ...
SIAM Journal on Computing 35 (1), 91-109, 2005
84*2005
Theoretical Analysis of the k-Means Algorithm – A Survey
J Blömer, C Lammersen, M Schmidt, C Sohler
Algorithm Engineering, 81-116, 2016
822016
Encoding a triangulation as a permutation of its point set.
M Denny, C Sohler
CCCG 97, 39-43, 1997
801997
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
792013
Estimating the weight of metric minimum spanning trees in sublinear time
A Czumaj, C Sohler
SIAM Journal on Computing 39 (3), 904-922, 2009
78*2009
Subspace embeddings for the L1-norm with applications
C Sohler, DP Woodruff
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
772011
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20