Skip to search formSkip to main contentSkip to account menu

Coreset

In computational geometry, a coreset is a small set of points that approximates the shape of a larger point set, in the sense that applying some… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
As the volume of data increase rapidly, most traditional machine learning algorithms become computationally prohibitive… 
2018
2018
In this paper, we propose to study a new geometric optimization problem called "geometric prototype" in Euclidean space. Given a… 
2017
2017
How can we train a statistical mixture model on a massive data set? In this paper, we show how to construct coresets for mixtures… 
2017
2017
We provide a deterministic data summarization algorithm that approximates the mean $\bar{p}=\frac{1}{n}\sum_{p\in P} p$ of a set… 
2015
2015
How can a \$20 toy quadcopter hover using a weak "Internet of Things" mini-board and a web-cam? In the pose-estimation problem we… 
2013
2013
We present an approach to position k servers (e.g. mobile robots) to provide a service to n independently moving clients; for… 
2011
2011
This paper defines a fundamentally new approach of capacity recovery of very noisy, practically completely useless optical… 
2010
2010
Let be a function that assigns a real number (P ) 0 to any point set P in R d ; for example, (P ) can be the diameter or radius… 
2008
2008
Bagging predictors have shown to be effective especially when the learners used to train the base classifiers are weak. In this… 
2005
2005
Let P be a set of n points in d-dimensional Euclidean space, where each of the points has integer coordinates from the range…