Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

70

Voted

SPAA
1992
ACM

favoriteEmaildiscussreport

88views Distributed And Parallel Com...» more SPAA 1992»

Separator Based Parallel Divide and Conquer in Computational Geometry

15 years 1 months ago

Separator Based Parallel Divide and Conquer in Computational Geometry

Download www.math.cmu.edu

An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on the use of sphere separators. Probability bounds are proved using the moment generating function technique.

Alan M. Frieze, Gary L. Miller, Shang-Hua Teng

Real-time Traffic

Distributed And Parallel Computing | K-nearest Neighbor Graph | Moment Generating Function | Processor Randomized Algorithm | SPAA 1992 |

claim paper

Related Content

» Parallel Rule Induction with Information Theoretic PrePruning

» A divide and conquer method for learning large Fuzzy Cognitive Maps

» Parallel Algorithm for Maximum Weight Matching in Trees

» On the parallelisation of MCMCbased image processing

» XJava Exploiting Parallelism with ObjectOriented Stream Programming

» An integrated background model for video surveillance based on primal sketch and 3D scene ...

» A Comparison of Sequential Delaunay Triangulation Algorithms

» Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Si...

» Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1992
Where	SPAA
Authors	Alan M. Frieze, Gary L. Miller, Shang-Hua Teng

Comments (0)