Results 291 to 300 of about 1,648,250 (343)
Some of the next articles are maybe not open access.
2012 24th Chinese Control and Decision Conference (CCDC), 2012
Hash table is a very important technique in computer games. With the development of computer Chinese Chess, hash table is wildly used and some of implementations are innovational. Several notable hash table implementations are introduced, some of them being new, while some combing with the specific modification on traditional ones, all considering ...
Wang Jiao+3 more
openaire +3 more sources
Hash table is a very important technique in computer games. With the development of computer Chinese Chess, hash table is wildly used and some of implementations are innovational. Several notable hash table implementations are introduced, some of them being new, while some combing with the specific modification on traditional ones, all considering ...
Wang Jiao+3 more
openaire +3 more sources
Computer/law journal, 2020
The inability to scale is one of the most concerning problems looming in blockchain systems, where every node has to store all contents of the ledger database locally, leading to centralization and higher operation costs.
Bin Yu, Xiaofeng Li, He Zhao
semanticscholar +1 more source
The inability to scale is one of the most concerning problems looming in blockchain systems, where every node has to store all contents of the ledger database locally, leading to centralization and higher operation costs.
Bin Yu, Xiaofeng Li, He Zhao
semanticscholar +1 more source
CHTKC: a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table
Briefings Bioinform., 2020MOTIVATION Calculating the frequency of occurrence of each substring of length k in DNA sequences is a common task in many bioinformatics applications, including genome assembly, error correction, and sequence alignment.
Jianan Wang+3 more
semanticscholar +1 more source
A High Throughput Parallel Hash Table Accelerator on HBM-enabled FPGAs
International Conference on Field-Programmable Technology, 2020Hash table is a key component in a number of AI algorithms such as Graph Convolutional Neural Networks, Approximate Nearest Neighbor Search, Bag-of-Words based Text Mining algorithms, etc.
Yang Yang, S. Kuppannagari, V. Prasanna
semanticscholar +1 more source
Load Balancing Hashing in Geographic Hash Tables
IEEE Transactions on Parallel and Distributed Systems, 2012In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic ...
Renda Elena, Resta Giovanni, Santi Paolo
openaire +3 more sources
Hash in a flash: Hash tables for flash devices [PDF]
Conservative estimates place the amount of data expected to be created by mankind this year to exceed several thousand exabytes. Given the enormous data deluge, and in spite of recent advances in main memory capacities, there is a clear and present need to move beyond algorithms that assume in-core (main-memory) computation.
Srinivasan Parthasarathy+4 more
openaire +1 more source
Shifting Hash Table: An Efficient Hash Table with Delicate Summary
2019 IEEE Globecom Workshops (GC Wkshps), 2019Hash tables have been broadly used in many security applications. These applications require fast query speed and high memory efficiency. However, the query speed degrades when hash collisions happen. The design goal of this paper is to achieve high load factor as well as fast query at the same time.
Binchao Yin+7 more
openaire +1 more source
Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage
IEEE Transactions on Services Computing, 2017Cloud storage is an increasingly popular application of cloud computing, which can provide on-demand outsourcing data services for both organizations and individuals.
H. Tian+6 more
semanticscholar +1 more source
Communications of the ACM, 1978
This paper presents pseudochaining as a new collision-resolution method. Pseudochaining is half way between open addressing and chaining. It owes its name to the fact that link fields are present in each cell of the hash table which permits “chaining” of the first overflow items in the table.
Constantine Halatsis, George Philokyprou
openaire +2 more sources
This paper presents pseudochaining as a new collision-resolution method. Pseudochaining is half way between open addressing and chaining. It owes its name to the fact that link fields are present in each cell of the hash table which permits “chaining” of the first overflow items in the table.
Constantine Halatsis, George Philokyprou
openaire +2 more sources