Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage
暂无分享,去创建一个
[1] Panagiotis Manolios,et al. Bloom Filters in Probabilistic Verification , 2004, FMCAD.
[2] James K. Mullin,et al. A second look at bloom filters , 1983, CACM.
[3] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[4] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[5] Simson L. Garfinkel,et al. Forensic feature extraction and cross-drive analysis , 2006, Digit. Investig..
[6] S. Schwartz,et al. Properties of the working-set model , 1972, OPSR.
[7] Golden G. Richard,et al. Multi-resolution similarity hashing , 2007, Digit. Investig..
[8] Bernard Chazelle,et al. The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.
[9] Michael Mitzenmacher,et al. Compressed bloom filters , 2002, TNET.
[10] Yixin Chen,et al. md5bloom: Forensic filesystem hashing revisited , 2006, Digit. Investig..
[11] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.