scientific article; zbMATH DE number 7053357
From MaRDI portal
Publication:5743480
zbMath1422.68259MaRDI QIDQ5743480
Xin Xiao, Kasturi R. Varadarajan
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095221
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Related Items
Core-Sets: Updated Survey ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ On Geometric Prototype and Applications ⋮ Learning big (image) data via coresets for dictionaries
Cites Work
- How to get close to the median shape
- High-dimensional shape fitting in linear time
- Approximating extent measures of points
- Sampling-based dimension reduction for subspace approximation
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- Approximate clustering via core-sets
- On coresets for k-means and k-median clustering
- A PTAS for k-means clustering based on weak coresets
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Sampling Algorithms and Coresets for $\ell_p$ Regression
- Coresets for Discrete Integration and Clustering
- A unified framework for approximating and clustering data
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Robust shape fitting via peeling and grating coresets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
