SIGN IN
SIGN UP
A fast k-means implementation using coresets
Full Text:
Pdf
Buy this Article
Authors:
Gereon Frahling
University of Paderborn, Paderborn, Germany
Christian Sohler
University of Paderborn, Paderborn, Germany
Published in:
· Proceeding
SCG '06
Proceedings of the twenty-second annual symposium on Computational geometry
Pages 135 - 143
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-340-9
doi>
10.1145/1137856.1137879
2006 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 63
· Downloads (cumulative): 1,322
· Citation Count: 9
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
clustering
coresets
geometric algorithms, languages, and systems
k-means
lloyds algorithm
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder