Loading...
Please wait, while we are loading the content...
Similar Documents
Non-expansive hashing (1998).
| Content Provider | CiteSeerX |
|---|---|
| Author | Linial, Nathan Sasson, Ori |
| Abstract | In a non-expansive hashing scheme, similar inputs are stored in memory locations which are close. We develop a non-expansive hashing scheme wherein any set of size O(R 1−ε) from a large universe may be stored in a memory of size R (any ε>0, and R>R 0(ɛ)), and where retrieval takes O(1) operations. We explain how to use non-expansive hashing schemes for efficient storage and retrieval of noisy data. A dynamic version of this hashing scheme is presented as well. |
| File Format | |
| Journal | This article is Published in Combinatorica |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
