Results 61 to 70 of about 914,695 (232)

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence

, 2013
Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core   +1 more source

A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key
Adel Binbusayyis, Abed Alanazi, Shtwai Alsubai, Areej Alasiry, Mehrez Marzougui, Abdullah Alqahtani, Mohemmed Sha, Muhammad Aslam   +7 more
wiley   +1 more source

Banal Radicalism: Free Spaces and the Routinization of Radical Practices in Far‐Right Movements

The British Journal of Sociology, EarlyView.
ABSTRACT How do free spaces become radicalizing spaces? Studies of far‐right radicalism have highlighted the role of insulated movement spaces in radicalizing their members. In these spaces, participants can flaunt their radical ideas and infuse them into everyday practices, forming these ideas into comprehensive and resilient worldviews.
Oded Marom
wiley   +1 more source

Quantum Period Finding is Compression Robust

, 2021
We study quantum period finding algorithms such as Simon and Shor (and its variants Eker{\aa}-H{\aa}stad and Mosca-Ekert). For a periodic function $f$ these algorithms produce -- via some quantum embedding of $f$ -- a quantum superposition $\sum_x |x ...
May, Alexander, Schlieper, Lars
core  

Fast hashing with Strong Concentration Bounds

, 2020
Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style concentration bounds on hash based sums, e.g., the number of balls/keys hashing to a given bin, but
Aamand Anders, Bernstein Sergei Natanovich, Celis L. Elisa, Dahlgaard Søren, Dumey A. I., Meka Raghu, Mitzenmacher Michael, şcu Mihai P, şcu Mihai P, şcu Mihai P   +9 more
core   +1 more source

Current application of blockchain technology in healthcare and its potential roles in Urology

BJU International, EarlyView.
Objective To assess the current uses of blockchain technology in surgery and explore potential applications in urology. Methods A systematic literature review and critical appraisal was performed. The PubMed database was searched for all relevant papers published in English, between 2003 and 2023, on blockchain and surgery, and urology.
Sulleyman Felemban, Ting Wai Yiu, Michael Harvey, Herman Lim, Jingge Zhu, Damien Bolton, Joseph Ischia   +6 more
wiley   +1 more source

The Message Authentication Code Based on Universal Hashing

Безопасность информационных технологий, 2012
The article covers the research of message authentication codes based on universal hashing. The new message authentication code algorithm is described here. The analysis of the algorithm is also provided in this article.
T. A. Bilyk, A. U. Nesterenko
doaj  

Smart Chaining: Templing and Temple Search

IEEE Access
Hash tables continue to be at the forefront of applications that require fast data lookup, but their usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/
Rajeev Ranjan Kumar Tripathi, Rahul Mishra, Shailesh Kumar Agrahari, Pradeep Kumar Singh, Sarvpal Singh   +4 more
doaj   +1 more source

3DGS.zip: A survey on 3D Gaussian Splatting Compression Methods

Computer Graphics Forum, EarlyView.
Abstract 3D Gaussian Splatting (3DGS) has emerged as a cutting‐edge technique for real‐time radiance field rendering, offering state‐of‐the‐art performance in terms of both quality and speed. 3DGS models a scene as a collection of three‐dimensional Gaussians, with additional attributes optimized to conform to the scene's geometric and visual properties.
M. T. Bagdasarian, P. Knoll, Y. Li, F. Barthel, A. Hilsmann, P. Eisert, W. Morgenstern   +6 more
wiley   +1 more source

Hybrid Classical–Quantum Text Search Based on Hashing

Mathematics
The paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring.
Farid Ablayev, Nailya Salikhova, Marat Ablayev   +2 more
doaj   +1 more source