Sciweavers

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

7

SODA
2001
ACM

favoriteEmaildiscussreport

103views Algorithms» more SODA 2001»

Reductions among high dimensional proximity problems

13 years 5 months ago

Reductions among high dimensional proximity problems

Download graphics.stanford.edu

Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan

Real-time Traffic

Algorithms | SODA 2001 |

claim paper

Related Content

» Dimensionality reduction techniques for proximity problems

» Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order

» An Adaptive and Efficient Dimensionality Reduction Algorithm for HighDimensional Indexing

» A General Cost Model for Dimensionality Reduction in High Dimensional Spaces

» On the Effects of Dimensionality Reduction on High Dimensional Similarity Search

» Input Decimation Ensembles Decorrelation through Dimensionality Reduction

» High Performance Dimension Reduction and Visualization for Large HighDimensional Data Anal...

» Analysis and extension of spectral methods for nonlinear dimensionality reduction

» Map building without localization by dimensionality reduction techniques

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan

Comments (0)