Sciweavers

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

12

FOCS
2002
IEEE

favoriteEmaildiscussreport

108views Theoretical Computer Science» more FOCS 2002»

On Approximating the Radii of Point Sets in High Dimensions

13 years 9 months ago

On Approximating the Radii of Point Sets in High Dimensions

Download www.cs.uiowa.edu

Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiaw

Real-time Traffic

FOCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Analysis of approximate nearest neighbor searching with clustered point sets

» Searching dynamic point sets in spaces with bounded doubling dimension

» A Simple Streaming Algorithm for Minimum Enclosing Balls

» Fast SmallestEnclosingBall Computation in High Dimensions

» Defining and computing accessibility radius

» Minimumcost coverage of point sets by disks

» On High Dimensional Skylines

» Coresets and Sketches for High Dimensional Subspace Approximation Problems

» HighDimensional Similarity Retrieval Using Dimensional Choice

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	FOCS
Authors	Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang

Comments (0)