Sciweavers

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

60

Voted

KDD
1999
ACM

favoriteEmaildiscussreport

141views Data Mining» more KDD 1999»

Density-Based Indexing for Approximate Nearest-Neighbor Queries

15 years 1 months ago

Density-Based Indexing for Approximate Nearest-Neighbor Queries

Download research.microsoft.com

Kristin P. Bennett, Usama M. Fayyad, Dan Geiger

Real-time Traffic

Data Mining | KDD 1999 |

claim paper

Related Content

» Approximation Techniques to Enable Dimensionality Reduction for VoronoiBased Nearest Neigh...

» PAC Nearest Neighbor Queries Approximate and Controlled Search in HighDimensional and Metr...

» Optimizing AllNearestNeighbor Queries with Trigonometric Pruning

» Quality and efficiency in high dimensional nearest neighbor search

» Efficient Reverse kNearest Neighbor Estimation

» Adaptive ClusterDistance Bounding for Nearest Neighbor Search in Image Databases

» Efficient Search in Document Image Collections

» Multidimensional reverse k NN search

» Pyramid Match Hashing SubLinear Time Indexing Over Partial Correspondences

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	KDD
Authors	Kristin P. Bennett, Usama M. Fayyad, Dan Geiger

Comments (0)