Filters








526 Hits in 4.7 sec

Morton Filters for Superior Template Protection for Iris Recognition [article]

Kiran B. Raja and R. Raghavendra and Sushma Venkatesh and Christoph Busch
2020 arXiv   pre-print
To this end, we propose and extend our earlier ideas of Morton-filters for obtaining better and reliable templates for iris.  ...  Such low-rank non-noisy iris codes enables realizing the template protection in a superior way which not only can be used in constrained setting, but also in relaxed iris imaging.  ...  MORTON FILTERS Morton Filters were originally proposed for the Approximate Set Membership Data Structures (ASMDSs) in the field of computing to make the storage efficient 1 [3] .  ... 
arXiv:2001.05290v1 fatcat:tuzhp3yd7bcg3nwczvjyweol4a

Establishing Multi-cast Groups in Computational Robotic Materials

Shang Ma, Homa Hosseinmardi, Nicholas Farrow, Richard Han, Nikolaus Correll
2012 2012 IEEE International Conference on Green Computing and Communications  
A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.  ...  We describe our Bloom filter-based multicast communication (BMC) protocol, and report experimental results using a 48node Computational Robotic Material test-bed engaged in shape and gesture recognition  ...  In the context of multicast, Bloom filters are useful in determining membership within a multicast group [11] .  ... 
doi:10.1109/greencom.2012.74 dblp:conf/greencom/MaHFHC12 fatcat:im3locou4vgsdbrudwugvb33gu

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation [article]

Xiaoyang Zhong, Yao Liang
2018 arXiv   pre-print
The probabilistic nature of the Bloom filter passively explores opportunistic routing.  ...  We devise a novel adaptive Bloom filter mechanism to effectively and efficiently encode a downward source-route in OSR, which enables a significant reduction of the length of source-route field in packet  ...  The link unicast retransmission ratio for both tests were around 50%, indicating a noisy and dynamic network condition.  ... 
arXiv:1802.03898v1 fatcat:vlpnqx2khzchjfo5bhhupmjkkm

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation

Xiaoyang Zhong, Yao Liang
2018 2018 IEEE 43rd Conference on Local Computer Networks (LCN)  
The probabilistic nature of the Bloom filter passively explores opportunistic routing.  ...  We devise a novel adaptive Bloom filter mechanism to effectively and efficiently encode a downward source-route in OSR, which enables a significant reduction of the length of source-route field in packet  ...  The link unicast retransmission ratio for both tests were around 50%, indicating a noisy and dynamic network condition.  ... 
doi:10.1109/lcn.2018.8638125 dblp:conf/lcn/ZhongL18 fatcat:lyn2xahtzfe6jiytn57vgzv2wa

Practical Near Neighbor Search via Group Testing [article]

Joshua Engels, Benjamin Coleman, Anshumali Shrivastava
2021 arXiv   pre-print
We instantiate this framework using distance-sensitive Bloom Filters to Identify Near-Neighbor Groups (FLINNG).  ...  We reduce the near neighbor search problem to a group testing problem by designating neighbors as "positives," non-neighbors as "negatives," and approximate membership queries as group tests.  ...  Distance-Sensitive Bloom Filters The distance-sensitive Bloom filter [11] is a data structure which solves the approximate set membership problem. Definition 2.  ... 
arXiv:2106.11565v1 fatcat:352ibweupbdbdlllmnmfy35mii

Multiclass Membership Determination Integrating an ID-Bound Method with Bloom Filter

Lu-I Chen, Heng Ma
2020 Information Technology and Control  
The array houses a circular bound representation and a Bloom filter, where the former encodes the members and makes judgments of queries, while the latter acts as a secondary means for programming cases  ...  Membership determination with classification is an essential function for a variety of applications, such as network routing and packet inspection.  ...  [3] also used an array composed of multi-bit cells, the noisy Bloom filter (NBF), where the first bitstream is the standard BF for encoding members, and the rest is to record the SIDs.  ... 
doi:10.5755/j01.itc.49.2.24633 fatcat:tjuzw4yve5crpfttbrem6wkhie

Data structures to represent a set of k-long DNA sequences [article]

Rayan Chikhi, Jan Holub, Paul Medvedev
2020 arXiv   pre-print
A set of k-mers has unique features and applications that, over the last ten years, have resulted in many specialized approaches for its representation.  ...  We hope this survey will serve as a resource for researchers in the field as well as make the area more accessible to researchers outside the field.  ...  Thus it cannot be used to test for membership without further additions.  ... 
arXiv:1903.12312v4 fatcat:hish4aqmjfc4vk2ccipkilcm5u

E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity

Adam C. Champion, Zhimin Yang, Boying Zhang, Jiangpeng Dai, Dong Xuan, Du Li
2013 IEEE Transactions on Parallel and Distributed Systems  
We propose a novel iterative Bloom filter (IBF) protocol that encodes topics to fit in SDP attributes and achieves a low false positive rate.  ...  We have implemented the system in Java ME for ease of deployment.  ...  This approach is non-intrusive and more efficient. 2) Basic Bloom Filter: The Bloom filter [7] is a time-and space-efficient probabilistic data structure for testing whether an element is a member of  ... 
doi:10.1109/tpds.2012.251 fatcat:5hsut6g3xbbsfasziwhuuaqhwu

E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity

Zhimin Yang, Boying Zhang, Jiangpeng Dai, Adam C. Champion, Dong Xuan, Du Li
2010 2010 IEEE 30th International Conference on Distributed Computing Systems  
We propose a novel iterative Bloom filter (IBF) protocol that encodes topics to fit in SDP attributes and achieves a low false positive rate.  ...  We have implemented the system in Java ME for ease of deployment.  ...  This approach is non-intrusive and more efficient. 2) Basic Bloom Filter: The Bloom filter [7] is a time-and space-efficient probabilistic data structure for testing whether an element is a member of  ... 
doi:10.1109/icdcs.2010.56 dblp:conf/icdcs/YangZDCXL10 fatcat:z7xqzccwx5cdzd7knntrh3vtvq

Privacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges [chapter]

Dinusha Vatsalan, Ziad Sehili, Peter Christen, Erhard Rahm
2017 Handbook of Big Data Technologies  
In this chapter, we describe the challenges of PPRL in the context of Big Data, survey existing techniques for PPRL, and provide directions for future research.  ...  However, privacy concerns impede sharing or exchanging data for linkage across different organizations.  ...  Service (DAAD) and Universities Australia (UA) under the Joint Research Co-operation Scheme, and also funded by the German Federal Ministry of Education and Research within the project Competence Center for  ... 
doi:10.1007/978-3-319-49340-4_25 fatcat:a6p7w4sannbmdkq4ceridmoan4

Streamed Data Analysis Using Adaptable Bloom Filter

Amritpal Singh, Shalini Batra
2018 Computing and informatics  
For predicting the array size of Bloom filter Kalman filter has been used.  ...  In such cases it is difficult to determine the optimal Bloom filter parameters (m, k) in advance, thus a target threshold for false positives (f p ) cannot be guaranteed.  ...  Generally, EKF are considered for multi-class problems.  ... 
doi:10.4149/cai_2018_3_693 fatcat:dpnom4ugurd5nhvm4vgmmz7qhm

Compression of high throughput sequencing data with probabilistic de Bruijn graph [article]

Gaëtan Benoit, Claire Lemaitre, Dominique Lavenier, Guillaume Rizk
2014 arXiv   pre-print
Instead, a reference is built de novo from the set of reads as a probabilistic de Bruijn Graph, stored in a Bloom filter.  ...  Leon achieved encoding of a C. elegans reads set with 0.7 bits/base, outperforming state of the art reference-free methods.  ...  The authors are also grateful to Thomas Derrien, Rayan Chikhi, Raluca Uricaru and Delphine Naquin for beta-testing. This work was supported by the ANR-12-EMMA-0019-01 GATB project.  ... 
arXiv:1412.5932v1 fatcat:c7oyln4xzzdf5c4ayqaricdfyi

A multi-cloud based privacy-preserving data publishing scheme for the internet of things

Lei Yang, Abdulmalik Humayed, Fengjun Li
2016 Proceedings of the 32nd Annual Conference on Computer Security Applications - ACSAC '16  
Attribute-based encryption (ABE) and outsourced-ABE has been used for secure message distribution in IoT, however, existing mechanisms suffer from extensive computation and/or privacy issues.  ...  We propose two multi-cloud-based outsourced-ABE schemes, namely the parallel-cloud ABE and the chain-cloud ABE, which enable the receivers to partially outsource the computationally expensive decryption  ...  In this way, the noisy Bloom filter designed for the chain-cloud scheme increases the transformation efficiency.  ... 
doi:10.1145/2991079.2991127 fatcat:wuxfvld3xbgzhi4arn3ym7aluu

Secure Federated Submodel Learning [article]

Chaoyue Niu, Fan Wu, Shaojie Tang, Lifeng Hua, Rongfei Jia, Chengfei Lv, Zhihua Wu, Guihai Chen
2019 arXiv   pre-print
Our secure scheme features the properties of randomized response, secure aggregation, and Bloom filter, and endows each client with a customized plausible deniability, in terms of local differential privacy  ...  However, the conventional framework requires each client to leverage the full model for learning, which can be prohibitively inefficient for resource-constrained clients and large-scale deep learning tasks  ...  sincerely thank some members of Advanced Network Laboratory (ANL) in Shanghai Jiao Tong University, including Renjie Gu, Hongtao Lv, Hejun Xiao, and Zhenzhe Zheng, as well as many colleagues in Alibaba, for  ... 
arXiv:1911.02254v2 fatcat:aankusilkjfbtcwboh6odhx4ju

Table of contents

2000 56th ARFTG Conference Digest  
Universita di Palermo, Palermo, Italy S-Parameter Test Set for Pulsed Networks Regan, A. Los Alamos National Laboratory Ziomek, C. Los Alamos National Laboratory Brooks, T.  ...  Compact Software Gigahertz Test Fixture For Two Port Passive Devices, A Cavin, M. University of Central Florida Malocha, D.  ... 
doi:10.1109/arftg.2000.327453 fatcat:iqd6hyp4x5c5hdku5mpn7sgkpi
« Previous Showing results 1 — 15 out of 526 results