Sariel Har-Peled mostly deals with Combinatorics, Discrete mathematics, Cluster analysis, Simple and Approximation algorithm. His work on Time complexity as part of general Combinatorics study is frequently linked to Running time, therefore connecting diverse disciplines of science. Sariel Har-Peled has researched Discrete mathematics in several fields, including Affine space, Fraction, Core and Projective clustering.
His Cluster analysis study combines topics in areas such as Voronoi diagram and Algorithm. His studies in Simple integrate themes in fields like Linear programming and Map coloring. His Approximation algorithm study incorporates themes from Art gallery problem, Fréchet distance, Line segment and Computational geometry.
Sariel Har-Peled mainly investigates Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Point. His biological study focuses on Binary logarithm. His work on Independent set and Planar graph is typically connected to Proximity search and Planar as part of general Discrete mathematics study, connecting several disciplines of science.
His Approximation algorithm research integrates issues from Computational geometry and Fréchet distance. His Time complexity research incorporates themes from Polygonal chain, Outlier and Constant. His research on Algorithm often connects related areas such as Cluster analysis.
Sariel Har-Peled mostly deals with Combinatorics, Approximation algorithm, Discrete mathematics, Point and Plane. His studies deal with areas such as Simple and Point set as well as Combinatorics. His Point set study integrates concerns from other disciplines, such as Centerpoint and Unit square.
His research integrates issues of Intersection, Computational geometry, Constant, Upper and lower bounds and Partition in his study of Approximation algorithm. His biological study spans a wide range of topics, including Graph and Polynomial expansion. His research in Time complexity intersects with topics in Rectangle and Planar graph.
His main research concerns Combinatorics, Approximation algorithm, Discrete mathematics, Point and Plane. A large part of his Combinatorics studies is devoted to Binary logarithm. The concepts of his Approximation algorithm study are interwoven with issues in Time complexity, Computational geometry, Fréchet distance and Partition.
His Discrete mathematics research includes themes of Dijkstra's algorithm, Johnson's algorithm and k-nearest neighbors algorithm. The study incorporates disciplines such as Probability distribution, Unit square, Dual and Connection in addition to Point. His Plane research is multidisciplinary, relying on both Set cover problem, Logarithm, Sublinear function, Streaming algorithm and Upper and lower bounds.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Sariel Har-Peled;Piotr Indyk;Rajeev Motwani.
Theory of Computing (2012)
On coresets for k-means and k-median clustering
Sariel Har-Peled;Soham Mazumdar.
symposium on the theory of computing (2004)
Approximate clustering via core-sets
Mihai Bādoiu;Sariel Har-Peled;Piotr Indyk.
symposium on the theory of computing (2002)
Geometric Approximation via Coresets
P. K. Agarwal;S. Har-Peled;K. Varadarajan.
Combinatorial and Computational Geometry, 2007, ISBN 0-521-84862-8, págs. 1-30 (2007)
Geometric Approximation Algorithms
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Gill Barequet;Sariel Har-Peled.
symposium on discrete algorithms (1999)
Smaller Coresets for k-Median and k-Means Clustering
Sariel Har-Peled;Akash Kushal.
Discrete and Computational Geometry (2007)
Approximating extent measures of points
Pankaj K. Agarwal;Sariel Har-Peled;Kasturi R. Varadarajan.
Journal of the ACM (2004)
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Sariel Har-Peled;Manor Mendel;Manor Mendel.
SIAM Journal on Computing (2006)
Constraint Classification for Multiclass Classification and Ranking
Sariel Har-Peled;Dan Roth;Dav Zimak.
neural information processing systems (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: