Prati
Sariel Har-Peled
Sariel Har-Peled
Professor of Computer Science, UIUC
Potvrđena adresa e-pošte na uiuc.edu
Naslov
Citirano
Citirano
Godina
On coresets for k-means and k-median clustering
S Har-Peled, S Mazumdar
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
6902004
Approximate clustering via core-sets
M Bādoiu, S Har-Peled, P Indyk
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
5122002
Geometric approximation via coresets
PK Agarwal, S Har-Peled, KR Varadarajan
Combinatorial and computational geometry 52 (1), 1-30, 2005
4822005
Geometric approximation algorithms
S Har-Peled
American Mathematical Soc., 2011
4612011
Constraint classification: A new approach to multi-class classification
S Har-Peled, D Roth, Z D.
Journal of Machine Learning Research 1, 113-141, 2000
415*2000
Approximate nearest neighbor: Towards removing the curse of dimensionality
S Har-Peled, P Indyk, R Motwani
Theory of Computing Exchange, 2012
4112012
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
G Barequet, S Har-Peled
Journal of Algorithms 38 (1), 91-109, 2001
3942001
Approximating extent measures of points
PK Agarwal, S Har-Peled, KR Varadarajan
Journal of the ACM (JACM) 51 (4), 606-635, 2004
3892004
Fast construction of nets in low dimensional metrics, and their applications
S Har-Peled, M Mendel
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
3582005
Smaller coresets for k-median and k-means clustering
S Har-Peled, A Kushal
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
3012005
Generalization Bounds for the Area Under the ROC Curve.
S Agarwal, T Graepel, R Herbrich, S Har-Peled, D Roth, MI Jordan
Journal of Machine Learning Research 6 (4), 2005
2852005
Optimally cutting a surface into a disk
J Erickson, S Har-Peled
Proceedings of the eighteenth annual symposium on Computational geometry …, 2002
2422002
Approximation algorithms for two optimal location problems in sensor networks
A Efrat, S Har-Peled, JSB Mitchell
2nd International Conference on Broadband Networks, 2005., 714-723, 2005
2282005
A replacement for Voronoi diagrams of near linear size
S Har-Peled
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 94-103, 2001
2242001
Approximation algorithms for maximum independent set of pseudo-disks
TM Chan, S Har-Peled
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
2222009
On approximating the depth and related problems
B Aronov, S Har-Peled
SIAM Journal on Computing 38 (3), 899-921, 2008
1772008
Near-linear time approximation algorithms for curve simplification
PK Agarwal, S Har-Peled, NH Mustafa, Y Wang
Algorithmica 42, 203-219, 2005
1772005
How Fast Is the k-Means Method?
S Har-Peled, B Sadri
Algorithmica 41, 185-202, 2005
1772005
Fréchet distance for curves, revisited
B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk
Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006
1642006
Approximating the Fréchet distance for realistic curves in near linear time
A Driemel, S Har-Peled, C Wenk
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
1602010
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20