Searching for "Expected-Case Complexity of Approximate Nearest Neighbor Searching." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Expected-Case Complexity of Approximate Nearest Neighbor Searching
by Sunil Arya, Ho-Yam Addy Fu — 2000 — In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms
…Expected-Case Complexity of Approximate Nearest Neighbor Searching Sunil Arya y Ho-Yam Addy Fu…
Cited by 6 (2 self) – Add To MetaCart

Expected-Case Complexity of Approximate Nearest Neighbor Searching
by Sunil Arya Ho-Yam, Sunil Arya, Ho-yam Addy Fu — 2000 — In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms
… Complexity of Approximate Nearest Neighbor Searching Sunil Arya y Ho-Yam Addy Fu z Abstract Most…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB