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

COMPGEOM

2006

ACM

2006

ACM

Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in X at distance at most r are mapped by H to the same value with probability at least p, and any two points at distance greater than cr are mapped by H to the same value with probability at most q. This notion was introduced by Indyk and Motwani in 1998 as the basis for an eﬃcient approximate nearest neighbor search algorithm, and has since been used extensively for this purpose. The performance of these algorithms is governed by the parameter ρ = log(1/p) log(1/q) , and constructing hash families with small ρ automatically yields improved nearest neighbor algorithms. Here we show that for X = 1 it is impossible to achieve ρ ≤ 1 2c . This almost matches the construction of Indyk and Motwani which achieves ρ ≤ 1 c .

Related Content

Added |
13 Jun 2010 |

Updated |
13 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
COMPGEOM |

Authors |
Rajeev Motwani, Assaf Naor, Rina Panigrahy |

Comments (0)