Sublinear-Time Approximation for Clustering via Random Sampling
C. Sohler, A. Czumaj, in: Automata, Languages and Programming (ICALP), 2004, pp. 396–407.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Sohler, Christian;
Czumaj, Artur
Publishing Year
Proceedings Title
Automata, Languages and Programming (ICALP)
Issue
1
Page
396-407
LibreCat-ID
Cite this
Sohler C, Czumaj A. Sublinear-Time Approximation for Clustering via Random Sampling. In: Automata, Languages and Programming (ICALP). ; 2004:396-407.
Sohler, C., & Czumaj, A. (2004). Sublinear-Time Approximation for Clustering via Random Sampling. In Automata, Languages and Programming (ICALP) (pp. 396–407).
@inproceedings{Sohler_Czumaj_2004, title={Sublinear-Time Approximation for Clustering via Random Sampling}, number={1}, booktitle={Automata, Languages and Programming (ICALP)}, author={Sohler, Christian and Czumaj, Artur}, year={2004}, pages={396–407} }
Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” In Automata, Languages and Programming (ICALP), 396–407, 2004.
C. Sohler and A. Czumaj, “Sublinear-Time Approximation for Clustering via Random Sampling,” in Automata, Languages and Programming (ICALP), 2004, no. 1, pp. 396–407.
Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” Automata, Languages and Programming (ICALP), no. 1, 2004, pp. 396–407.
Google Scholar