Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"efficient range-summability"”.

  1. Efficient locality sensitive hashing: solutions, primitives, and applications

    … to 1286 and 54.5 times. Second, we design new, efficient algorithmic primitives for LSH. We solve four open problems, namely efficient range-summability (ERS) in 1D random variables of arbitrary distributions, ERS in 2D and higher dimensions, approximately answering range-sum queries over a data …

    gatech Repository record for Efficient locality sensitive hashing: solutions, primitives, and applications (opens in a new tab)