Results 61 to 70 of about 2,234,842 (311)
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters [PDF]
, 2020 The Bloom filter provides fast approximate set membership while using little memory. Engineers often use these filters to avoid slow operations such as disk or network accesses.
Lemire, Daniel, Graf, Thomas Mueller
core +1 more source
Approximate membership query algorithm for incomplete data based on Bloom filter
Dianzi Jishu Yingyong, 2022 More and more scenarios require approximate membership queries for incomplete query data, but traditional Bloom filters for membership queries cannot meet these requirements.
Wu Jiawen +4 more
doaj +1 more source
Hardware acceleration for power efficient deep packet inspection [PDF]
, 2012 The rapid growth of the Internet leads to a massive spread of malicious attacks like viruses and malwares, making the safety of online activity a major concern. The use of Network Intrusion Detection Systems (NIDS) is an effective method to safeguard the
Zhou, Yachao
core +1 more source
A Bloom Filter for High Dimensional Vectors
Information, 2018 Regardless of the type of data, traditional Bloom filters treat each element of a set as a string, and by iterating every character of the string, they discretize all data randomly and uniformly. However, with the data size and dimension increases, these
Chunyan Shuai +3 more
doaj +1 more source
Fusogenic RNA Nanomodules for Fusion‐Mediated and Multiplexed siRNA Delivery
Advanced Functional Materials, EarlyView.A fusogenic lipid‐layered RNA nanomodules (L‐CRAMs) enable high‐capacity and long‐lasting siRNA delivery through membrane fusion. These nanomodules carry exceptionally large siRNA payloads, avoid conventional endosomal uptake, and release multiple functional siRNAs through Dicer‐mediated processing.
Sunghyun Moon +5 more
wiley +1 more source
High-performance IP lookup using Intel Xeon Phi: a Bloom filters based approach
Journal of Internet Services and Applications, 2018 IP lookup is a core operation in packet forwarding, which is implemented using a Longest Prefix Matching (LPM) algorithm to find the next hop for an input address.
Alexandre Lucchesi +2 more
doaj +1 more source
Bloom Filters, Adaptivity, and the Dictionary Problem [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2017 An approximate membership query data structure (AMQ)—such as a Bloom, quotient, or cuckoo filter—maintains a compact, probabilistic representation of a set S of keys from a universe U. It supports lookups and inserts. Some AMQs also support deletes.
M. Bender +5 more
semanticscholar +1 more source
One‐Step Curcumin‐Mediated Multiphoton Lithography for Bioactive 3D Scaffolds
Advanced Functional Materials, EarlyView.Curcumin‐mediated multiphoton lithography enables one‐step fabrication of highly architected complex gelatin methacryloyl scaffolds by exploiting curcumin as a multifunctional bioactive photoinitiator. The resulting 3D structures support mesenchymal stem cell adhesion, proliferation, and migration, while exhibiting dual antibacterial activity through ...
Myrto Charitaki +7 more
wiley +1 more source
Secure Data Provenance in IoT Network using Bloom Filters
Procedia Computer Science, 2019 Internet of Things (IoT) network are considered the future in monitoring and surveillance. With the advent of autonomous organization, and network and service management, conventional networks are fast integrated with IoT networks.
M. Siddiqui, Atiqur Rahman, A. Nadeem
semanticscholar +1 more source
The deletable Bloom filter: a new member of the Bloom family [PDF]
IEEE Communications Letters, 2010 We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting elements. The DlBF design enables false-negative-free deletions at a fraction of the cost in memory consumption, which turns to be appealing for certain probabilistic filter ...
Christian Esteve Rothenberg +3 more
openaire +4 more sources