Masayuki Oguri

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Locality-Sensitive Hashing (LSH) is a well-known approximate nearest-neighbor search algorithm for high-dimensional data. Though LSH searches nearest-neighbor points for a query very fast, LSH has a drawback that the space complexity is very large. For this reason, so as to apply LSH to a large dataset, it is crucial to implement LSH in distributed(More)
  • 1