Parnas M., Robust Algorithms and Data Structures for Information Retrieval, Ph. D. dissertation, Hebrew University, Jerusalem, Israel, 1994.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Non-Expansive Hashing - Linial, Sasson (1996) (17 citations) (Correct)
....and it is required to store D in such a way that on query string q, the member of D closest to q in Hamming distance be retrieved. The version where all members in D of distance d or less from q be retrieved is the Approximate Query (AQ) problem of [6] Most of the work on these problems (see [9] and the references therein) focuses on deterministic schemes. However, deterministic hashing schemes are rather limited, especially for the dynamic dictionary problem (e.g. 2] so we resort to randomized tools. We were much inspired by the landmark paper by Fredman Koml os and Szemer edi [5] ....
Parnas M., Robust Algorithms and Data Structures for Information Retrieval, Ph. D. dissertation, Hebrew University, Jerusalem, Israel, 1994.
Simple Algorithms for Hot-Potato Routing - Krauthgamer (1996) (Correct)
....and it is required to store D in such as way that on query q, the member of D closest to q in Hamming distance be retrieved. The version where all members in D of distance d or less from q need to be retrieved is the Approximate Query (AQ) problem of [14] Most of the work on these problems (see [24] and the references therein) focuses on deterministic schemes. Linial and Sasson [20] devise a noisy hashing scheme for a one dimensional universe U and a one dimensional memory M , with any noise measure Delta. It is a nonexpansive hashing scheme, i.e. one which translates every ....
M. Parnas. "Robust Algorithms and Data structures for information retrieval ". Ph.D. dissertation, Hebrew University, Jerusalem, Israel, 1994.
Stereoscopic families of permutations, and their applications.. - Feige, al. (Correct)
....the hashing function. Moreover, elements y 2 D x might be hashed to distant locations in the memory. Large memory is usually paged, in which case the procedure might require access to W(jD x j) different pages. The problem of hashing noisy data appears in several variants in many applications (see [13, 8, 6, 15] and references therein) Linial and Sasson [12] devise a noisy hashing scheme for a one dimensional universe U and a one dimensional memory M , with any noise measure D. It is a non expansive hashing scheme, i.e. one which translates every D neighborhood in U to a constant number of ....
M. Parnas. Robust Algorithms and Data structures for information retrieval. Ph.D. dissertation, Hebrew University, Jerusalem, Israel, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC