ID Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications.


https://doi.org/10.1109/ICC.2018.8422627
@inproceedings{DBLP:conf/icc/LiuWG0ZUL18, author = {Peng Liu and Hao Wang and Siang Gao and Tong Yang and Lei Zou and Lorna Uden and Xiaoming Li}, title = {{ID} Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications}, booktitle = {2018 {IEEE} International Conference on Communications, {ICC} 2018, Kansas City, MO, USA, May 20-24, 2018}, pages = {1--6}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/ICC.2018.8422627}, doi = {10.1109/ICC.2018.8422627}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/icc/LiuWG0ZUL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21