Zobrazeno 1 - 10
of 1 180
pro vyhledávání: '"Dynamic perfect hashing"'
Publikováno v:
IEEE Transactions on Network and Service Management. 19:991-1005
Benefiting from dense connections in data center networks (DCNs), load balancing algorithms are capable of steering traffic into multiple paths for the sake of preventing traffic congestion. However, given each path’s time-varying and asymmetrical
Autor:
Jie Gui, Tao Li, Yuhan Wu, Xiang Yu, Haochen Gan, Zirui Liu, Yuhao Han, Ori Rottenstreich, Tong Yang
Publikováno v:
KDD
Perfect hashing is a hash function that maps a set of distinct keys to a set of continuous integers without collision. However,most existing perfect hash schemes are static, which means that they cannot support incremental updates, while most dataset
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 28:2703-2715
Multimodal hashing approaches have gained great success on large-scale cross-modal similarity search applications, due to their appealing computation and storage efficiency. However, it is still a challenge work to design binary codes to represent th
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 28:2716-2729
The hashing method maps similar data of various types to binary hashcodes with smaller hamming distance, and it has received broad attention due to its low-storage cost and fast retrieval speed. However, the existing limitations make the present algo
Byte-addressable persistent memory (PM) brings hash tables the potential of low latency, cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent Memory Modules (DCPMM) further accelerates this trend. Many new hash tabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2eca60334bd3020386034ad7eb9ab7ae
http://arxiv.org/abs/2003.07302
http://arxiv.org/abs/2003.07302
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030507428
ISC
ISC
Hash table is a fundamental data structure that provides efficient data store and access. It is a key component in AI applications which rely on building a model of the environment using observations and performing lookups on the model for newer obse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::440206dc50efe4c4d9c82a15aa62ced7
https://doi.org/10.1007/978-3-030-50743-5_1
https://doi.org/10.1007/978-3-030-50743-5_1
Publikováno v:
Pattern Recognition. 76:273-287
The increasing advancement of mobile technology explosively popularizes the mobile devices (e.g. iPhone, iPad). A large number of mobile devices provide great convenience and cost effectiveness for the speaker recognition based applications. However,
Publikováno v:
Pattern Recognition. 75:136-148
Indexing methods have been widely used for fast data retrieval on large scale datasets. When the data are represented by high dimensional vectors, hashing is often used as an efficient solution for approximate similarity search. When a retrieval task
Publikováno v:
Pattern Recognition. 75:128-135
Recent years have witnessed the promising efficacy and efficiency of hashing (also known as binary code learning) for retrieving nearest neighbor in large-scale data collections. Particularly, with supervision knowledge (e.g., semantic labels), we ma
Publikováno v:
Pattern Recognition. 75:175-187
As far as we know, we are the first to propose a general framework to incorporate the quantization-based methods into the conventional similarity-preserving hashing, in order to improve the effectiveness of hashing methods. In theory, any quantizatio