Non-Expansive Hashing
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 from a large universe may be stored in a memory of size (any , and ), and where retrieval takes operations. We explain how to use non-expan...
Saved in:
Main Authors: | LINIAL, N., SASSON, Ori |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1998
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/15 http://dx.doi.org/10.1007/pl00009805 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Non-Expansive Hashing
by: LINIAL, Nathan, et al.
Published: (1996) -
Property Testing of Data Dimensionality
by: KRAUTHGRAMER, R., et al.
Published: (2003) -
IBM Websphere 4.0: The Complete Reference
by: RON, Ben-Natan, et al.
Published: (2002) -
IBM WebSphere Starter Kit
by: RON, Ben-Natan, et al.
Published: (2000) -
IBM SanFrancisco Developers Guide
by: RON, Ben-Natan, et al.
Published: (1999)