Results 71 to 80 of about 1,756,456 (179)
Avoiding Rotated Bitboards with Direct Lookup [PDF]
, 2007 This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core
Towards an Analysis of Quadratic Probing [PDF]
Since 1968, one of the simplest open questions in the theory of hash tables has been to prove anything nontrivial about the correctness of quadratic probing.
Kuszmaul, William, Xi, Zoe
core +1 more source
Fast Structural Alignment of Biomolecules Using a Hash Table, N-Grams and String Descriptors
Algorithms, 2009 This work presents a generalized approach for the fast structural alignment of thousands of macromolecular structures. The method uses string representations of a macromolecular structure and a hash table that stores n-grams of a certain size for ...
Robert Preissner +6 more
doaj +1 more source
Online Supervised Hashing for Ever-Growing Datasets [PDF]
arXiv, 2015 Supervised hashing methods are widely-used for nearest neighbor search in computer vision applications. Most state-of-the-art supervised hashing approaches employ batch-learners. Unfortunately, batch-learning strategies can be inefficient when confronted with large training datasets.
arxiv
Fast distributed video deduplication via locality-sensitive hashing with similarity ranking
EURASIP Journal on Image and Video Processing, 2019 The exponentially growing amount of video data being produced has led to tremendous challenges for video deduplication technology. Nowadays, many different deduplication approaches are being rapidly developed, but they are generally slow and their ...
Yeguang Li, Liang Hu, Ke Xia, Jie Luo
doaj +1 more source
A Classification Retrieval Method for Encrypted Speech Based on Deep Neural Network and Deep Hashing
IEEE Access, 2020 In order to improve the retrieval efficiency and accuracy of the existing encrypted speech retrieval methods, and improve the semantic representation of speech features and classification performance, a classification retrieval method for encrypted ...
Qiuyu Zhang, Xuejiao Zhao, Yingjie Hu
doaj +1 more source
ZHT: A Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table
2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013 This paper presents ZHT, a zero-hop distributed hash table, which has been tuned for the requirements of high-end computing systems. ZHT aims to be a building block for future distributed systems, such as parallel and distributed file systems ...
Tonglin Li +7 more
semanticscholar +1 more source
DHash: Enabling Dynamic and Efficient Hash Tables [PDF]
arXiv, 2020 Given a specified average load factor, hash tables offer the appeal of constant time lookup operations. However, hash tables could face severe hash collisions because of malicious attacks, buggy applications, or even bursts of incoming data, compromising this practical advantage.
arxiv
Datacollection in Event-Driven Wireless Sensor Networks with Mobile Sinks
International Journal of Distributed Sensor Networks, 2010 We present a two-tier distributed hash table-based scheme for data-collection in event-driven wireless sensor networks. The proposed method leverages mobile sinks to significantly extend the lifetime of the sensor network. We propose localized algorithms
Harshavardhan Sabbineni +1 more
doaj +1 more source
Cuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications [PDF]
arXiv, 2017 Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, firewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory
arxiv