scientific article; zbMATH DE number 7651177
From MaRDI portal
Publication:5874507
DOI10.4230/LIPIcs.ESA.2020.38MaRDI QIDQ5874507
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2004.10090
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the least trimmed squares estimator
- Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography
- On enclosing k points by a circle
- A \(k\)-median algorithm with running time independent of data size
- Practical methods for shape fitting and kinetic data structures using coresets
- Clustering to minimize the maximum intercluster distance
- Computing the smallest \(k\)-enclosing circle and related problems
- High-dimensional shape fitting in linear time
- Support-vector networks
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Sublinear time algorithms for metric space problems
- Approximate Čech Complex in Low and High Dimensions
- Property testing and its connection to learning and approximation
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- Better streaming algorithms for clustering problems
- Shape Fitting with Outliers
- Sublinear-time Algorithms
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- Sublinear optimization for machine learning
- Approximate minimum enclosing balls in high dimensions using core-sets
- Automata, Languages and Programming
- Algorithms - ESA 2003
This page was built for publication:
