Zobrazeno 1 - 10
of 377
pro vyhledávání: '"Open addressing"'
Publikováno v:
Algorithms, Vol 16, Iss 11, p 500 (2023)
Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load facto
Externí odkaz:
https://doaj.org/article/8970adcb6f0f4c0d950c6cc9afae9351
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.
Conference
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:
Dapeng Liu, Shaochun Xu
Publikováno v:
International Journal of Networked and Distributed Computing (IJNDC), Vol 3, Iss 1 (2015)
In this paper, we conducted empirical experiments to study the performance of hashing with a large set of data and compared the results of different collision approaches. The experiment results leaned more to closed addressing than to open addressing
Externí odkaz:
https://doaj.org/article/9653ed05ba744af2ab191d147fd628b1
Autor:
Gordon Lyon
Publikováno v:
J Res Natl Bur Stand (1977)
A simple linear probing and exchanging method of Burkhard locally rearranges hash tables to account for reference frequencies. Examples demonstrate how frequency-sensitive rearrangements that depend upon linear probing can significantly enhance searc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e933db8206f5697134f750f05da3565
https://pubmed.ncbi.nlm.nih.gov/34565998
https://pubmed.ncbi.nlm.nih.gov/34565998
Publikováno v:
FMCAD
2019 Formal Methods in Computer Aided Design (FMCAD), 46-54
STARTPAGE=46;ENDPAGE=54;TITLE=2019 Formal Methods in Computer Aided Design (FMCAD)
Van Der Berg, F I & Van De Pol, J 2019, Concurrent chaining hash maps for software model checking . in C Barrett & J Yang (eds), Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019 ., 8894279, IEEE, pp. 46-54, 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019, San Jose, United States, 22/10/2019 . https://doi.org/10.23919/FMCAD.2019.8894279
2019 Formal Methods in Computer Aided Design (FMCAD), 46-54
STARTPAGE=46;ENDPAGE=54;TITLE=2019 Formal Methods in Computer Aided Design (FMCAD)
Van Der Berg, F I & Van De Pol, J 2019, Concurrent chaining hash maps for software model checking . in C Barrett & J Yang (eds), Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019 ., 8894279, IEEE, pp. 46-54, 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019, San Jose, United States, 22/10/2019 . https://doi.org/10.23919/FMCAD.2019.8894279
Stateful model checking creates numerous states which need to be stored and checked if already visited. One option for such storage is a hash map and this has been used in many model checkers. In particular, we are interested in the performance of co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::631c0d4a872ef0552f7146f5b687b3e6
http://www.scopus.com/inward/record.url?scp=85075591170&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85075591170&partnerID=8YFLogxK
Publikováno v:
Algorithmica. 81:3162-3185
We consider space efficient hash tables that can grow and shrink dynamically and are always highly space efficient, i.e., their space consumption is always close to the lower bound even while growing and when taking into account storage that is only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d5be21dc9da808607ce133cd97e153a
https://doi.org/10.1007/s00453-019-00572-x
https://doi.org/10.1007/s00453-019-00572-x
Autor:
Saira Kaye Manalili, Candace Claire Mercado, Aaron Russell Fajardo, Raphael Zapanta, Roger Luis Uy
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789813340688
Over the past few years, next-generation sequencing has become an invaluable technology for numerous applications in the field of genomics. The success of these applications are dependent on the performance of each phase in the genomic sequence pipel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::122912fc9981025f9d7e55f028778491
https://doi.org/10.1007/978-981-33-4069-5_16
https://doi.org/10.1007/978-981-33-4069-5_16
Autor:
Alfredo Viola, Patricio V. Poblete
Publikováno v:
Combinatorics, Probability and Computing. 28:600-617
Thirty years ago, the Robin Hood collision resolution strategy was introduced for open addressing hash tables, and a recurrence equation was found for the distribution of its search cost. Although this recurrence could not be solved analytically, it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d45b35ef4a3aacf051fa2d4b865b89f0
https://doi.org/10.1017/s0963548318000408
https://doi.org/10.1017/s0963548318000408
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