A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov. A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. In STOC. pages 305-311, 1999. [doi]

This author has not been identified. Look up 'Amit Chakrabarti' in GoogleThis author has not been identified. Look up 'Bernard Chazelle' in GoogleThis author has not been identified. Look up 'Benjamin Gum' in GoogleThis author has not been identified. Look up 'Alexey Lvov' in Google

runs on WebDSL