Results 81 to 90 of about 9,951 (116)

Provably secure and lightweight blockchain based cross hospital authentication scheme for IoMT-based healthcare. [PDF]

Sci Rep
Xie Q, Ding Z.
europepmc   +1 more source

Harnessing AI and analytics to enhance cybersecurity and privacy for collective intelligence systems. [PDF]

PeerJ Comput Sci
Naeem MR, Amin R, Farhan M, Alotaibi FA, Alnfiai MM, Sampedro GA, Karovič V.   +6 more
europepmc   +1 more source

When less is more: sketching with minimizers in genomics. [PDF]

Genome Biol
Ndiaye M, Prieto-Baños S, Fitzgerald LM, Yazdizadeh Kharrazi A, Oreshkov S, Dessimoz C, Sedlazeck FJ, Glover N, Majidian S.   +8 more
europepmc   +1 more source

Optimization of network device hardening in a multivendor environment. [PDF]

Sci Rep
Imoukhuede AB, Sheltami TR, Mahmoud AH, Barnawi AY.   +3 more
europepmc   +1 more source

An optimal peer selection for peer-to-peer video content distribution using fuzzy linear programming approach. [PDF]

PeerJ Comput Sci
Anandaraj M, S N.
europepmc   +1 more source

T cell receptor-centric perspective to multimodal single-cell data analysis. [PDF]

Sci Adv
Mullan KA, Ha M, Valkiers S, de Vrij N, Ogunjimi B, Laukens K, Meysman P.   +6 more
europepmc   +1 more source

A reinforcement learning approach to effective forecasting of pediatric hypoglycemia in diabetes I patients using an extended de Bruijn graph. [PDF]

Sci Rep
Cakiroglu MO, Kurban H, Aljihmani L, Qaraqe K, Petrovski G, Dalkilic MM.   +5 more
europepmc   +1 more source

Tissue determinants of the human T cell receptor repertoire.

Sureshchandra S, Henderson J, Levendosky E, Bhattacharyya S, Kastenschmidt JM, Sorn AM, Mitul MT, Benchorin A, Batucal K, Daugherty A, Murphy SJ, Thakur C, Trask D, Ahuja G, Moisan A, Tiffeau-Mayer A, Saligrama N, Wagar LE.   +17 more
europepmc   +1 more source

AI augmented edge and fog computing for Internet of Health Things (IoHT). [PDF]

PeerJ Comput Sci
Rajagopal D, Subramanian PKT.
europepmc   +1 more source

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1988
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes $O(1)$ worst-case time for lookups and $O(1)$ amortized expected time for insertions and ...
Kurt Mehlhorn, Hans Rohnert, Martin Dietzfelbinger, Anna R. Karlin, Robert E. Tarjan, F.M. auf der Heide   +5 more
  +7 more sources