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(R1-ϵ) from a large universe may be stored in a memory of size R (any ϵ > 0, and R > R0(ϵ)), and where retrieval takes 0(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.
|Original language||American English|
|Title of host publication||Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996|
|Publisher||Association for Computing Machinery|
|Number of pages||10|
|State||Published - 1 Jul 1996|
|Event||28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States|
Duration: 22 May 1996 → 24 May 1996
|Name||Proceedings of the Annual ACM Symposium on Theory of Computing|
|Conference||28th Annual ACM Symposium on Theory of Computing, STOC 1996|
|Period||22/05/96 → 24/05/96|
Bibliographical notePublisher Copyright:
© 1996 ACM.