Results 231 to 240 of about 170,509 (285)
Some of the next articles are maybe not open access.
Deep-Like Hashing-in-Hash for Visual Retrieval: An Embarrassingly Simple Method
IEEE Transactions on Image Processing, 2020Existing hashing methods have yielded significant performance in image and multimedia retrieval, which can be categorized into two groups: shallow hashing and deep hashing. However, there still exist some intrinsic limitations among them. The former generally adopts a one-step strategy to learn the hashing codes for discovering the discriminative ...
Lei Zhang +4 more
openaire +2 more sources
Trustworthy biometric hashing method
2009 IEEE 17th Signal Processing and Communications Applications Conference, 2009In this paper, we propose a novel biometric hashing method. We employ a password-generated random projection matrix applied to the face images directly instead of applying to the features extracted from face images and improve the methods in the literature. We aim to preserve privacy while achieving desirable accuracy in a biometric verification system.
Cagatay Karabat, Hakan Erdogan
openaire +1 more source
Hashing methods for temporal data
IEEE Transactions on Knowledge and Data Engineering, 2002External dynamic hashing has been used in traditional database systems as a fast method for answering membership queries. Given a dynamic set S of objects, a membership query asks whether an object with identity k is in (the most current state of) S. This paper addresses the more general problem of temporal hashing.
G. Kollios, V.J. Tsotras
openaire +1 more source
Fast trajectory clustering using Hashing methods
2016 International Joint Conference on Neural Networks (IJCNN), 2016There has been an explosion in the usage of trajectory data. Clustering is one of the simplest and most powerful approaches for knowledge discovery from trajectories. In order to produce meaningful clusters, well-defined metrics are required to capture the essence of similarity between trajectories.
Ivan Sanchez +3 more
openaire +1 more source
Communications of the ACM, 1981
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +2 more sources
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +2 more sources
Capacity analysis of biometric hashing methods
2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU), 2011We address the capacity analysis problem for the biometric hashing methods in this work. To the best of our knowledge, there is no work on this topic in the literature up to now. We develop an information theoretic capacity analysis method for biometric hashing methods. The proposed method depends on the within-class noise resilience which is analogues
Cagatay Karabat +2 more
openaire +1 more source
An Enhanced SHA3-based Hashing Method
Proceedings of the 2019 8th International Conference on Software and Information Engineering, 2019When a software implementation of a security system is considered, side channel attacks are on the spot threat. Side-channel attacks, considered in this work, are a class of physical attacks in which an adversary tries to exploit physical information leakages such as timing information, power consumption, or electromagnetic radiation to estimate ...
A. Samir Abo-Taleb +3 more
openaire +1 more source
The ComBack Method – Extending Hash Compaction with Backtracking
2007This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state space is guaranteed. Each encountered state is mapped into a compressed state descriptor (hash value) as in hash compaction.
Westergaard, Michael +3 more
openaire +3 more sources
A dynamic hash method with signature
ACM Transactions on Database Systems, 1991We present a dynamic external hash method that allows retrieval of a record by only one access to mass storage while maintaining a high load factor. The hash function is based on generalized spiral storage. Both primary and overflow records are allocated to the same file, and file expansion depends on being able to allocate every overflow chain to one ...
F. Cesarini, G. Soda
openaire +1 more source
A Family of Perfect Hashing Methods
The Computer Journal, 1996Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal ...
Majewski, BS +3 more
openaire +2 more sources