The following pages link to Christian Sohler (Q472479):
Displayed 50 items.
- Random projections for Bayesian regression (Q144017) (← links)
- Analysis of agglomerative clustering (Q472480) (← links)
- Item:Q472479 (redirect page) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Dissection-BKW (Q1784110) (← links)
- Fair coresets and streaming algorithms for fair \(k\)-means (Q2193095) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Fast reconstruction of Delaunay triangulations (Q2486080) (← links)
- (Q2753932) (← links)
- (Q2768392) (← links)
- Every Property of Hyperfinite Graphs Is Testable (Q2848211) (← links)
- Probabilistic k-Median Clustering in Data Streams (Q2848915) (← links)
- BICO: BIRCH Meets Coresets for k-Means Clustering (Q2849339) (← links)
- Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness (Q2912878) (← links)
- What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? (Q2922000) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Clustering for metric and nonmetric distance measures (Q2930341) (← links)
- (Q2934631) (← links)
- Testing Cluster Structure of Graphs (Q2941567) (← links)
- Tolerant Algorithms (Q3092276) (← links)
- (Q3113695) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Smoothed analysis of left-to-right maxima with applications (Q3189072) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- (Q3396583) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- A Distributed Algorithm for the Facility Location Problem (Q3439480) (← links)
- (Q3443153) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- Estimating Clustering Indexes in Data Streams (Q3527252) (← links)
- Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time (Q3575153) (← links)
- (Q3579409) (← links)
- Estimating the weight of metric minimum spanning trees in sublinear-time (Q3580967) (← links)
- Coresets in dynamic geometric data streams (Q3581392) (← links)
- Testing Euclidean Spanners (Q3586451) (← links)
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications (Q3590961) (← links)
- (Q3601532) (← links)
- A PTAS for k-means clustering based on weak coresets (Q3602851) (← links)
- A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
- d-Dimensional Knapsack in the Streaming Model (Q3639267) (← links)
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs (Q3654386) (← links)
- (Q4411413) (← links)
- Randomized Pursuit-Evasion in Graphs (Q4471150) (← links)
- (Q4471376) (← links)
- (Q4535042) (← links)
- Clustering time series under the Fréchet distance (Q4575634) (← links)