Zobrazeno 1 - 10
of 309
pro vyhledávání: '"Hopscotch hashing"'
Autor:
Pugh, Matthew
Key-value stores are ubiquitous at all layers of the computational stack; offering constant average lookup, insertion, and deletion time. This dissertation looks at how we can exploit skew in the workloads to improve the temporal locality afforded in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______463::d56764c9fcd42e379f530e4ec74b682e
https://hdl.handle.net/1842/39102
https://hdl.handle.net/1842/39102
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Timm, Henning
In Bioinformatics, a large group of problems requires the computation or estimation of sequence similarity. However, the analysis of biological sequence data has, among many others, three capital challenges: a large amount generated data which contai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______134::cfe494cc38d14d0a2933b1cb472c62ec
http://hdl.handle.net/2003/41188
http://hdl.handle.net/2003/41188
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2bafbc70a54520a2188f87e27627140
https://doi.org/10.1109/tcsvt.2017.2710345
https://doi.org/10.1109/tcsvt.2017.2710345
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e0116796698493b0bd3b48380d9d37c
https://doi.org/10.1016/j.patcog.2017.03.021
https://doi.org/10.1016/j.patcog.2017.03.021
Publikováno v:
Computers & Graphics. 70:71-79
A novel multidimensional hashing scheme, named the Exclusive Grouped Spatial Hashing (EGSH), which compresses repetitive spatial data into several compact tables while retaining efficient random access, is presented. EGSH represents a multi-level has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32eebe9b506ae3f2727a7846235b38b6
https://doi.org/10.1016/j.cag.2017.08.012
https://doi.org/10.1016/j.cag.2017.08.012
Autor:
Zhouchen Lin, Yameng Huang
Publikováno v:
IEEE Transactions on Image Processing. 27:406-418
Hashing is a useful technique for fast nearest neighbor search due to its low storage cost and fast query speed. Unsupervised hashing aims at learning binary hash codes for the original features so that the pairwise distances can be best preserved. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::753f3d637d15a9dfbeabedf30e31944f
https://doi.org/10.1109/tip.2017.2759250
https://doi.org/10.1109/tip.2017.2759250
Publikováno v:
Neurocomputing. 275:916-923
Hashing-based methods have been widely applied in large scale image retrieval problem due to its high efficiency. In real world applications, it is difficult to require all images in a large database being labeled while unsupervised methods waste inf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1ac28a3ffc366b482b6fde85de25051
https://doi.org/10.1016/j.neucom.2017.09.042
https://doi.org/10.1016/j.neucom.2017.09.042
Publikováno v:
Signal Processing: Image Communication. 59:117-130
Hashing has been attracting much attention in computer vision recently, since it can provide efficient similarity comparison in massive multimedia databases with fast query speed and low storage cost. Since the distance metric is an explicit descript
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::926ba35abc540fc46ada66e2d9534262
https://doi.org/10.1016/j.image.2017.07.002
https://doi.org/10.1016/j.image.2017.07.002
Publikováno v:
IEEE Transactions on Image Processing. 26:5367-5380
To overcome the barrier of storage and computation when dealing with gigantic-scale data sets, compact hashing has been studied extensively to approximate the nearest neighbor search. Despite the recent advances, critical design issues remain open in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6f027b0a430fe251b8281fcdd5728cf
https://doi.org/10.1109/tip.2017.2695895
https://doi.org/10.1109/tip.2017.2695895