Results 261 to 270 of about 27,498 (296)
Some of the next articles are maybe not open access.
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 will occur during the insertion of an item, requiring an expensive rehashing of all items in ...
Adam Kirsch +2 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Deep Fuzzy Hashing Network for Efficient Image Retrieval
IEEE Transactions on Fuzzy Systems, 2021Xing Xu, Huimin Lu, Heng Tao Shen
exaly
MTFH: A Matrix Tri-Factorization Hashing Framework for Efficient Cross-Modal Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Zhikai Hu, Yiu-ming Cheung, Xin Liu
exaly
2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012
Jae-Pil Heo +4 more
openaire +2 more sources
Jae-Pil Heo +4 more
openaire +2 more sources

