Results 21 to 30 of about 170,509 (285)
Theoretical and Experimental Analysis of Cryptographic Hash Functions
The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions.
Jacek Tchórzewsk +1 more
doaj +1 more source
Efficient Sentiment-Aware Web Crawling Methods for Constructing Sentiment Dictionary
In traditional web crawling, all web pages crawled are first stored to databases. As a result, this approach can store unnecessary web pages and requires additional running time for the construction of a sentiment dictionary in a particular domain ...
Byung-Won On +5 more
doaj +1 more source
Randomized computations must work. Following a long time of awful examination into transformative programming, we check the generation of XML, which exemplifies the fitting gauges of frameworks organization. We use perfect epistemologies to disconfirm that red-dull trees [2] and neighborhood can scheme to comprehend this desire [4].
S. Pothumani, R. Kavitha, R. Velvizhi
openaire +1 more source
Design and Comparison of Image Hashing Methods: A Case Study on Cork Stopper Unique Identification
Cork stoppers were shown to have unique characteristics that allow their use for authentication purposes in an anti-counterfeiting effort. This authentication process relies on the comparison between a user’s cork image and all registered cork images in ...
Ricardo Fitas +3 more
doaj +1 more source
Evaluation Test and Improvement of Load Balancing Algorithms of Nginx
Today most people can’t live without electronic devices. And more and more new devices are coming to the market every day. Apps running on these devices often connect to one or several web-based server side applications, which in turn put a lot of
Chen Ma, Yuhong Chi
doaj +1 more source
A Practical Minimal Perfect Hashing Method [PDF]
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluation of h(x) requires two memory accesses for any key x and the description of h takes up 1.15n words.
Fabiano C. Botelho +2 more
openaire +1 more source
A Survey of RFID Authentication Protocols Based on Hash-Chain Method [PDF]
Security and privacy are the inherent problems in RFID communications. There are several protocols have been proposed to overcome those problems. Hash chain is commonly employed by the protocols to improve security and privacy for RFID authentication ...
Chang, Elizabeth +3 more
core +2 more sources
An efficient supervised deep hashing method for image retrieval
Abstract Recently, retrieving and searching for relevant images from large datasets has become increasingly challenging for researchers. Hashing methods that mapped raw data into a short binary code have attracted increasing attention from the researcher.
Abid Hussain +5 more
openaire +3 more sources
Large-Scale Person Re-Identification Based on Deep Hash Learning
Person re-identification in the image processing domain has been a challenging research topic due to the influence of pedestrian posture, background, lighting, and other factors.
Xian-Qin Ma +3 more
doaj +1 more source
Online Adaptive Supervised Hashing for Large-Scale Cross-Modal Retrieval
In recent years, with the continuous growth of multimedia data on the Internet, multimodal hashing has attracted increasing attention for its efficiency in large-scale cross-modal retrieval.
Ruoqi Su +4 more
doaj +1 more source

