Xiaoyin Pan

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
We study the problem of approximate nearest neighbor search in $d$-dimensional Hamming space {0,1}<sup>d</sup>. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe model with limited adaptivity, where the algorithm makes k rounds of parallel accesses to the data(More)
  • 1