C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal.
Lingxiao Huang
Nisheeth K. Vishnoi
Published in:
STOC (2020)
Keyphrases
</>
importance sampling
euclidean space
monte carlo
data points
clustering algorithm
shape analysis
markov chain
vector space
riemannian manifolds
kalman filter
euclidean distance
particle filtering
prior knowledge
low dimensional
dynamic programming
k means
image sequences