Sariel Har-Peled

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
52Minimum Convex Partitions and Maximum Empty Polytopes. Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth. CoRR (abs/1112.1124) (2011). Web SearchBibTeXDownload
51Computing the Fréchet Distance Between Folded Polygons. Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk. CoRR (abs/1103.2865) (2011). Web SearchBibTeXDownload
50Geometric Packing under Non-uniform Constraints. Alina Ene, Sariel Har-Peled, Benjamin Raichel. CoRR (abs/1107.2949) (2011). Web SearchBibTeXDownload
49Computing the Fréchet Distance between Folded Polygons. Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk. WADS 2011, 267-278. Web SearchBibTeXDownload
2010
48Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
47Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Anne Driemel, Sariel Har-Peled, Carola Wenk. CoRR (abs/1003.0460) (2010). Web SearchBibTeXDownload
46Approximating the Fréchet distance for realistic curves in near linear time. Anne Driemel, Sariel Har-Peled, Carola Wenk. Symposium on Computational Geometry 2010, 365-374. Web SearchBibTeXDownload
2009
45On the Set Multi-Cover Problem in Geometric Settings. Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled. CoRR (abs/0909.0537) (2009). Web SearchBibTeXDownload
44On the set multi-cover problem in geometric settings. Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled. Symposium on Computational Geometry 2009, 341-350. Web SearchBibTeXDownload
43Covering Many or Few Points with Unit Disks. Mark de Berg, Sergio Cabello, Sariel Har-Peled. Theory Comput. Syst. (45): 446-469 (2009). Web SearchBibTeXDownload
2008
42Robust Shape Fitting via Peeling and Grating Coresets. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. Discrete & Computational Geometry (39): 38-58 (2008). Web SearchBibTeXDownload
41Range Medians. Sariel Har-Peled, S. Muthukrishnan. ESA 2008, 503-514. Cited by 5Web SearchBibTeXDownload
40The Euclidean Orienteering Problem Revisited. Ke Chen, Sariel Har-Peled. SIAM J. Comput. (38): 385-397 (2008). Web SearchBibTeXDownload
2007
39Maximum Margin Coresets for Active and Noise Tolerant Learning. Sariel Har-Peled, Dan Roth, Dav Zimak. IJCAI 2007, 836-841. Web SearchBibTeXDownload
38Embeddings of surfaces, curves, and moving points in euclidean space. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. Symposium on Computational Geometry 2007, 381-389. Web SearchBibTeXDownload
2006
37On the Least Median Square Problem. Jeff Erickson, Sariel Har-Peled, David M. Mount. Discrete & Computational Geometry (36): 593-607 (2006). Web SearchBibTeXDownload
36Fréchet Distance for Curves, Revisited. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk. ESA 2006, 52-63. Cited by 12Web SearchBibTeXDownload
35Robust shape fitting via peeling and grating coresets. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. SODA 2006, 182-191. Web SearchBibTeXDownload
34The orienteering problem in the plane revisited. Ke Chen, Sariel Har-Peled. Symposium on Computational Geometry 2006, 247-254. Web SearchBibTeXDownload
33Covering Many or Few Points with Unit Disks. Mark de Berg, Sergio Cabello, Sariel Har-Peled. WAOA 2006, 55-68. Web SearchBibTeXDownload
2005
32Near-Linear Time Approximation Algorithms for Curve Simplification. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang. Algorithmica (42): 203-219 (2005). Web SearchBibTeXDownload
31Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled. CCCG 2005, 43-46. Web SearchBibTeXDownload
30Separability with Outliers. Sariel Har-Peled, Vladlen Koltun. ISAAC 2005, 28-39. Web SearchBibTeXDownload
29Generalization Bounds for the Area Under the ROC Curve. Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth. Journal of Machine Learning Research (6): 393-425 (2005). Web SearchBibTeXDownload
2004
28Optimally Cutting a Surface into a Disk. Jeff Erickson, Sariel Har-Peled. Discrete & Computational Geometry (31): 37-59 (2004). Web SearchBibTeXDownload
27Approximating extent measures of points. Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan. J. ACM (51): 606-635 (2004). Web SearchBibTeXDownload
26On the least median square problem. Jeff Erickson, Sariel Har-Peled, David M. Mount. Symposium on Computational Geometry 2004, 273-279. Web SearchBibTeXDownload
2003
25When Crossings Count - Approximating the Minimum Spanning Tree. Sariel Har-Peled, Piotr Indyk. CoRR (cs.CG/0303001) (2003). Web SearchBibTeXDownload
24Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. Symposium on Computational Geometry 2003, 282-291. Web SearchBibTeXDownload
23Efficient algorithms for shared camera control. Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg. Symposium on Computational Geometry 2003, 68-77. Web SearchBibTeXDownload
2002
22Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
21STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled. ALENEX 2002, 178-193. Web SearchBibTeXDownload
20Computing Approximate Shortest Paths on Convex Polytopes. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Algorithmica (33): 227-242 (2002). Web SearchBibTeXDownload
19Constraint Classification: A New Approach to Multiclass Classification. Sariel Har-Peled, Dan Roth, Dav Zimak. ALT 2002, 365-379. Web SearchBibTeXDownload
18Reporting intersecting pairs of convex polytopes in two and three dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. Comput. Geom. (23): 195-207 (2002). Web SearchBibTeXDownload
17New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali. Discrete & Computational Geometry (28): 535-569 (2002). Web SearchBibTeXDownload
16Near-Linear Time Approximation Algorithms for Curve Simplification. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang. ESA 2002, 29-41. Web SearchBibTeXDownload
15On generalization bounds, projection profile, and margin distribution. Ashutosh Garg, Sariel Har-Peled, Dan Roth. ICML 2002, 171-178. Web SearchBibTeX
14Constraint Classification for Multiclass Classification and Ranking. Sariel Har-Peled, Dan Roth, Dav Zimak. NIPS 2002, 785-792. Web SearchBibTeXDownload
13Approximate clustering via core-sets. Mihai Badoiu, Sariel Har-Peled, Piotr Indyk. STOC 2002, 250-257. Cited by 152Web SearchBibTeXDownload
12Optimally cutting a surface into a disk. Jeff Erickson, Sariel Har-Peled. Symposium on Computational Geometry 2002, 244-253. Web SearchBibTeXDownload
2001
11Maintaining approximate extent measures of moving points. Pankaj K. Agarwal, Sariel Har-Peled. SODA 2001, 148-157. Web SearchBibTeXDownload
10Morphing between polylines. Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali. SODA 2001, 680-689. Web SearchBibTeXDownload
9Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. WADS 2001, 122-134. Web SearchBibTeXDownload
2000
8Approximation Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Discrete & Computational Geometry (24): 687-705 (2000). Web SearchBibTeXDownload
7Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. Nord. J. Comput. (7): 227-240 (2000). Web SearchBibTeX
6Sweeping simple polygons with a chain of guards. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali. SODA 2000, 927-936. Web SearchBibTeXDownload
5Computing the Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. SWAT 2000, 328-338. Web SearchBibTeXDownload
4When crossings count - approximating the minimum spanning tree. Sariel Har-Peled, Piotr Indyk. Symposium on Computational Geometry 2000, 166-175. Cited by 8Web SearchBibTeXDownload
3Computing approximate shortest paths on convex polytopes. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Symposium on Computational Geometry 2000, 270-279. Web SearchBibTeXDownload
1999
2Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Symposium on Computational Geometry 1999, 380-389. Web SearchBibTeXDownload
1997
1Approximating shortest paths on a convex polytope in three dimensions. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan. J. ACM (44): 567-584 (1997). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research