Results 41 to 50 of about 2,234,842 (311)
Redundant RFID Data Removing Algorithm Based on Dynamic-additional Bloom Filter [PDF]
Jisuanji kexue, 2021 The high redundancy generated by RFID devices in reading tag information will result in pressure of real-time transmission,waste of storage space and unreliable analysis results of upper application.To slove these problems,a dynamic-additional Bloom ...
DUAN Wen, ZHOU Liang
doaj +1 more source
The Bloom paradox: When not to use a Bloom filter? [PDF]
2012 Proceedings IEEE INFOCOM, 2012 In this paper, we uncover the Bloom paradox in Bloom Filters: Sometimes, the Bloom Filter is harmful and should not be queried. We first analyze conditions under which the Bloom paradox occurs in a Bloom Filter and demonstrate that it depends on the a priori probability that a given element belongs to the represented set. We show that the Bloom paradox
Ori Rottenstreich, Isaac Keslassy
openaire +2 more sources
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL [PDF]
, 2013 Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks.
Voigt, Thiemo, +7 more
core +1 more source
Efficient Bloom Filter-Based Routing Protocol for Scalable Mobile Networks
Engineering Proceedings, 2023 Non-geographic routing protocols are inefficient when applied to large-scale mobile networks composed of hundreds of nodes. On the other hand, geographic routing protocols have the disadvantage of needing a location sensor.
Prabu S. +4 more
doaj +1 more source
Low-power bloom filter architecture for deep packet inspection [PDF]
, 2006 Bloom filters are frequently used to identify malicious content like viruses in high speed networks. However, architectures proposed to implement bloom filters are not power efficient.
Kocak, Taskin +3 more
core +1 more source
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage
The Journal of Privacy and Confidentiality, 2014 Bloom filter encoded identifiers are increasingly used for privacy preserving record linkage applications, because they allow for errors in encrypted identifiers. However, little research on the security of Bloom filters has been published so far.
Frank Niedermeyer +3 more
doaj +1 more source
Sequence Data Matching and Beyond: New Privacy-Preserving Primitives Based on Bloom Filters
IEEE Transactions on Information Forensics and Security, 2020 Bloom filter encoding has widely been used as an efficient masking technique for privacy-preserving matching functions. The existing matching techniques, however, are limited to relatively simple types such as string, categorical and signal numerical ...
Wanli Xue +3 more
semanticscholar +1 more source
Developing Bloom Filters for Web Archives' Holdings
, 2021 The collaborating parties from LANL and Croatian Web Archive (HAW) are reporting on their work related to the IIPC-funded "Developing Bloom Filters for Web Archives' Holdings" project.
Celjak, Draženko +4 more
core +1 more source
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Dynamically Allocated Bloom Filter-Based PIT Architectures
IEEE Access, 2022 As a key component in implementing Named Data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup.
Saeyoung Jang, Hayoung Byun, Hyesook Lim
doaj +1 more source