Results 21 to 30 of about 447,111 (170)

File organization using composite perfect hashing

ACM Transactions on Database Systems, 1989
Perfect hashing refers to hashing with no overflows. We propose and analyze a composite perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in a single disk access.
M. Ramakrishna, P. Larson
semanticscholar   +1 more source

A Survey of Hashing Techniques for High Performance Computing [PDF]

, 2016
Hashing is a well-known and widely used technique for providing O(1) access to large files on secondary storage and tables in memory. Hashing techniques were introduced in the early 60s.
, G M Sridevi, M V Ramakrishna
core   +2 more sources

Cuckoo Hashing

Encyclopedia of Algorithms, 2001
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. [SIAM J. Comput. 23 (4) (1994) 738-761].
R. Pagh, Flemming Friche Rodler
semanticscholar   +1 more source

A comprehensive evaluation of alignment algorithms in the context of RNA-seq. [PDF]

, 2012
Transcriptome sequencing (RNA-Seq) overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level.
Friedel, Caroline C., Lindner, Robert
core   +2 more sources

Twofold Video Hashing with Automatic Synchronization

, 2014
Video hashing finds a wide array of applications in content authentication, robust retrieval and anti-piracy search. While much of the existing research has focused on extracting robust and secure content descriptors, a significant open challenge still ...
Li, Mu, Monga, Vishal
core   +1 more source

Pinterest Board Recommendation for Twitter Users [PDF]

, 2015
Pinboard on Pinterest is an emerging media to engage online social media users, on which users post online images for specific topics. Regardless of its significance, there is little previous work specifically to facilitate information discovery based on
Li, Yuncheng, Luo, Jiebo, Yang, Xitong
core   +1 more source

Scalable and Sustainable Deep Learning via Randomized Hashing

, 2016
Current deep learning architectures are growing larger in order to learn from complex datasets. These architectures require giant matrix multiplication operations to train millions of parameters.
Chen Wenlin, Gionis Aristides, Indyk Piotr, Loosli Gaëlle, Lv Qin, McMahan H. Brendan, Recht Benjamin, Shrivastava Anshumali, Shrivastava Anshumali   +8 more
core   +1 more source

Outback: Fast and Communication-efficient Index for Key-Value Store on Disaggregated Memory [PDF]

Proceedings of the VLDB Endowment
Disaggregated memory systems achieve resource utilization efficiency and system scalability by distributing computation and memory resources into distinct pools of nodes.
Yi Liu, Minghao Xie, Shouqian Shi, Yuanchao Xu, Heiner Litz, Chen Qian   +5 more
semanticscholar   +1 more source

Deterministic and efficient minimal perfect hashing schemes [PDF]

, 2013
Neste trabalho apresentamos versões determinísticas para os esquemasde hashing de Botelho, Kohayakawa e Ziviani (2005) e por Botelho, Pagh e Ziviani(2007).
Donadelli Jr., Jair, Zatesko, Leandro Miranda   +1 more
core   +2 more sources

GPERF : a perfect hash function generator [PDF]

, 1992
gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element ...
Schmidt, Douglas C., Suda, Tatsuya
core