Results 31 to 40 of about 119,966 (182)
A scalable bloom filter based prefilter and hardware-oriented predispatcher [PDF]
, 2009 Presented in this paper a scalable bloom filter based prefilter and a hardware-oriented predispatcher pattern matching mechanism for content filtering applications, which are scalable in terms of speed, the number of patterns and the pattern length ...
Lall, Ashwin +5 more
core +1 more source
Optimized hash for network path encoding with minimized false positives [PDF]
, 2014 The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives.
Carrea, Laura +2 more
core +1 more source
Hash Adaptive Bloom Filter [PDF]
2021 IEEE 37th International Conference on Data Engineering (ICDE), 2021 Bloom filter is a compact memory-efficient probabilistic data structure supporting membership testing, i.e., to check whether an element is in a given set. However, as Bloom filter maps each element with uniformly random hash functions, few flexibilities are provided even if the information of negative keys (elements are not in the set) are available ...
Xie, Rongbiao +6 more
openaire +2 more sources
RFID data reliability optimiser based on two dimensions bloom filter [PDF]
, 2017 Radio frequency identification (RFID) is a flexible deployment technology that has been adopted in many applications especially in supply chain management.
A. Alothman, Asma +7 more
core +1 more source
Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding [PDF]
, 2014 Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts.
Babarczi, Péter +5 more
core +1 more source
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.
Duquennoy, Simon +2 more
core +2 more sources
A Distance-Encoded Bloom Filter for Fast NDN Name Lookup
Applied SciencesNamed data networking (NDN) is a content-centric network architecture that requires efficient name lookup to forward packets based on hierarchical content names.
Junghwan Kim, Myeong-Cheol Ko
doaj +1 more source
Applied Sciences, 2020 Because the development of the Internet of Things (IoT) requires technology that transfers information between objects without human intervention, the core of IoT security will be secure authentication between devices or between devices and servers ...
Jungwon Lee +4 more
doaj +1 more source
Idempotent distributed counters using a Forgetful Bloom Filter [PDF]
, 2015 Distributed key-value stores power the backend of high-performance web services and cloud computing applications. Key-value stores such as Cassandra rely heavily on counters to keep track of the occurrences of various kinds of events.
Subramanyam, Rajath
core +1 more source
Combine multi-dimension Bloom filter for membership queries
Tongxin xuebao, 2008 Based on the analysis of multi-dimension Bloom filter（MDBF） presented before, a combine multi-dimension Bloom filter（CMBE） was presented. CMDBF adds a combine Bloom filter （CBF） to MDBF to assist in representing the whole element.
XIE Kun1 +4 more
doaj +2 more sources