Difference between pages "Logfile Analysis" and "Bloom Filters"
From Forensics Wiki
(Difference between pages)
m |
m (New page: =References= * [http://www.internetmathematics.org/volumes/1/4/Broder.pdf Network Applications of Bloom Filters: A Survey], Andrei Broder and Michael Mitzenmacher, Internet Mathematics Vol...) |
||
| Line 1: | Line 1: | ||
| − | = | + | =References= |
| − | + | * [http://www.internetmathematics.org/volumes/1/4/Broder.pdf Network Applications of Bloom Filters: A Survey], Andrei Broder and Michael Mitzenmacher, Internet Mathematics Vol. 1, No 4: 485--509 | |
| − | + | * [http://portal.acm.org/citation.cfm?id=1151659.1159950 Beyond bloom filters: from approximate membership checks to approximate state machines], Bonomi et all, ACM SIGCOMM Computer Communication Review archive, Volume 36 , Issue 4 (October 2006) | |
| − | + | ||
| − | : | + | |
| − | + | * Burton H. Bloom, [http://portal.acm.org/citation.cfm?id=362692&dl=GUIDE&coll=GUIDE&CFID=59101912&CFTOKEN=60283506 Space/time trade-offs in hash coding with allowable errors], Communications of the ACM, v.13 n.7, p.422-426, July 1970 | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
Revision as of 23:38, 12 March 2008
References
- Network Applications of Bloom Filters: A Survey, Andrei Broder and Michael Mitzenmacher, Internet Mathematics Vol. 1, No 4: 485--509
- Beyond bloom filters: from approximate membership checks to approximate state machines, Bonomi et all, ACM SIGCOMM Computer Communication Review archive, Volume 36 , Issue 4 (October 2006)
- Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, v.13 n.7, p.422-426, July 1970
