Non-Expansive Hashing
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– C) from a large universe may be stored in a memory of size R (any e > 0, and R > Ro(c)), and where retrieval takes O(1) ope...
Saved in:
Main Authors: | LINIAL, Nathan, SASSON, Ori |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
1996
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/1250 http://dx.doi.org/10.1145/237814.237999 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Deep hashing by discriminating hard examples
由: YAN, Cheng, et al.
出版: (2019) -
Non-Expansive Hashing
由: LINIAL, N., et al.
出版: (1998) -
DyCuckoo: Dynamic hash tables on GPUs
由: LI, Yuchen, et al.
出版: (2021) -
Network analysis and traceability on ethereum blockchain
由: Su, Voon Hou
出版: (2021) -
Analysis of 3D compression via fringe projection profilometry techniques
由: Chan, Alvin Ming Kai
出版: (2023)