Results 251 to 260 of about 23,863 (307)
Efficient authentication system based on blockchain for E-government. [PDF]
PLoS OneLiu L, Omote K.
europepmc +1 more source
Design of a Blockchain-Enabled Traceability System for <i>Pleurotus ostreatus</i> Supply Chains. [PDF]
FoodsGuo H, Xu W, Lin M, Zhang X, Liu P.
europepmc +1 more source
The problem of coherence of a distributed hash table
, 2013 D.Paulraj K.Balachander +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
Proceedings of the 2015 International Symposium on Memory Systems, 2015
Hash tables are a commonly used data structure used in many algorithms and applications. As applications and data scale, the efficient implementation of hash tables becomes increasingly important and challenging. In particular, memory capacity becomes increasingly important and entries can become asymmetrically chained across hash buckets.
Zhaoxia Deng +3 more
openaire +1 more source
Hash tables are a commonly used data structure used in many algorithms and applications. As applications and data scale, the efficient implementation of hash tables becomes increasingly important and challenging. In particular, memory capacity becomes increasingly important and entries can become asymmetrically chained across hash buckets.
Zhaoxia Deng +3 more
openaire +1 more source
Journal of Algorithms, 1985
Summary: We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derived on the unrestricted problem, that is, without making any assumptions about the probing ...
openaire +2 more sources
Summary: We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derived on the unrestricted problem, that is, without making any assumptions about the probing ...
openaire +2 more sources
Efficient Ordering of Hash Tables
SIAM Journal on Computing, 1979We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new elements are added is presented. Under the assumption of having a reasonable hash function sequence, it is shown that, even with a full table, only about 2.13 probes will be required, on the average, to access an element ...
Gonnet, Gaston H., Munro, J. Ian
openaire +2 more sources
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.
Jie Jiang +7 more
openaire +1 more source
2007 IEEE Wireless Communications and Networking Conference, 2007
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
Proceedings of the 1977 annual conference on - ACM '77, 1977
This paper investigates a relatively new file structure known as an ordered hash table which combines the flexibility of indexed sequential files with the rapid access of traditional hashing methods. The main results of the paper are: (1) a characterization of optimal hash tables allowing for differing access frequencies among the keys, and (2) an ...
Donald L. Adolphson, Glenn N. Thomas
openaire +1 more source
This paper investigates a relatively new file structure known as an ordered hash table which combines the flexibility of indexed sequential files with the rapid access of traditional hashing methods. The main results of the paper are: (1) a characterization of optimal hash tables allowing for differing access frequencies among the keys, and (2) an ...
Donald L. Adolphson, Glenn N. Thomas
openaire +1 more source