Results 41 to 50 of about 119,966 (182)
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023 This version extends the 4-page version published in ACM SAC 2023 and adds a section on Experimental ...
Ana Rodrigues +3 more
openaire +3 more sources
Set reconciliation based on counting Bloom filters
Tongxin xuebao, 2012 A new set reconciliation algorithm was presented,which called counting-Bloom-filter based set reconciliation(CBFSR).This method represented sets SA and SB as counting Bloom filters,subtracts SA's counting Bloom filter from SB's counting Bloom filter,the ...
Xiao-mei TIAN +5 more
doaj +2 more sources
Energy-efficient pipelined bloom filters for network intrusion detection [PDF]
, 2006 This document is made available in accordance with publisher policies. Please cite only the published version using the reference above.
Kaya, I, Kocak, T
core +3 more sources
Route Prefix Caching Using Bloom Filters in Named Data Networking
Applied Sciences, 2020 This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure.
Junghwan Kim +3 more
doaj +1 more source
, 2006 A Bloom filter is a simple randomized data structure that answers membership query with no false negative and a small false positive probability. It is an elegant data compression technique for membership information, and has broad applications.
Bruck, Jehoshua +2 more
core
Bloom Filters and Compact Hash Codes for Efficient and Distributed Image Retrieval [PDF]
, 2016 This paper presents a novel method for efficient image retrieval, based on a simple and effective hashing of CNN features and the use of an indexing structure based on Bloom filters.
Bertini, Marco +3 more
core +2 more sources
Don't Thrash: How to Cache Your Hash on Flash [PDF]
, 2012 This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has found wide application in databases, storage systems, and networks ...
Bender, Michael A. +9 more
core +1 more source
A Novel Prefix Cache with Two-Level Bloom Filters in IP Address Lookup
Applied Sciences, 2020 Prefix caching is one of the notable techniques in enhancing the IP address lookup performance which is crucial in packet forwarding. A cached prefix can match a range of IP addresses, so prefix caching leads to a higher cache hit ratio than IP address ...
Junghwan Kim +3 more
doaj +1 more source
Privacy-Preserving Public Route Planning Based on Passenger Capacity
Mathematics, 2023 Precise route planning needs huge amounts of trajectory data recorded in multimedia devices. The data, including each user’s location privacy, are stored as cipher text.
Xin Zhang +3 more
doaj +1 more source
Context discovery using attenuated Bloom filters in ad-hoc networks [PDF]
, 2006 A novel approach to performing context discovery in ad-hoc networks based on the use of attenuated Bloom filters is proposed in this paper. In order to investigate the performance of this approach, a model has been developed.
Heijenk, Geert, Liu, Fei
core +5 more sources