Results 131 to 140 of about 7,628 (169)
Some of the next articles are maybe not open access.
BIT, 1978
A new file organisation called dynamic hashing is presented. The organisation is based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file.
openaire +2 more sources
A new file organisation called dynamic hashing is presented. The organisation is based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file.
openaire +2 more sources
Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81, 1981
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file may be highly dynamic, even may be constituted entirely with insertions. The load factor is typically about 70 %. The search for a record is performed in only one disk access, for files attaining millions of records.
openaire +1 more source
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file may be highly dynamic, even may be constituted entirely with insertions. The load factor is typically about 70 %. The search for a record is performed in only one disk access, for files attaining millions of records.
openaire +1 more source
2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014
Hashing technique has become a promising approach for fast similarity search. Most of existing hashing research pursue the binary codes for the same type of entities by preserving their similarities. In practice, there are many scenarios involving nearest neighbor search on the data given in matrix form, where two different types of, yet naturally ...
Xianglong Liu 0001 +3 more
openaire +1 more source
Hashing technique has become a promising approach for fast similarity search. Most of existing hashing research pursue the binary codes for the same type of entities by preserving their similarities. In practice, there are many scenarios involving nearest neighbor search on the data given in matrix form, where two different types of, yet naturally ...
Xianglong Liu 0001 +3 more
openaire +1 more source
2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013
Recent studies have shown that hashing methods are effective for high dimensional nearest neighbor search. A common problem shared by many existing hashing methods is that in order to achieve a satisfied performance, a large number of hash tables (i.e., long code-words) are required.
Yue Lin 0003 +4 more
openaire +1 more source
Recent studies have shown that hashing methods are effective for high dimensional nearest neighbor search. A common problem shared by many existing hashing methods is that in order to achieve a satisfied performance, a large number of hash tables (i.e., long code-words) are required.
Yue Lin 0003 +4 more
openaire +1 more source
Journal of the American Society for Information Science, 1972
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire +1 more source
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire +1 more source
Learning to hash: forgiving hash functions and applications
Data Mining and Knowledge Discovery, 2008The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire +1 more source
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing, 2008Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there is a polynomially small but practically significant probability that a failure occurs during the insertion of an item, requiring an expensive rehashing of all items in the ...
Adam Kirsch +2 more
openaire +1 more source
2006
In this paper, we explore potential mathematical principles and structures that can provide the foundation for cryptographic hash functions, and also present a simple and efficiently computable hash function based on a non-associative operation with polynomials over a finite field of characteristic 2.
openaire +1 more source
In this paper, we explore potential mathematical principles and structures that can provide the foundation for cryptographic hash functions, and also present a simple and efficiently computable hash function based on a non-associative operation with polynomials over a finite field of characteristic 2.
openaire +1 more source
Deep Fuzzy Hashing Network for Efficient Image Retrieval
IEEE Transactions on Fuzzy Systems, 2021Xing Xu, Huimin Lu, Heng Tao Shen
exaly