Comments for Cool/Snap? http://www.coolsnap.net/kevin Almost, but not quite, entirely unlike discourse Mon, 18 Feb 2008 08:12:49 +0000 http://wordpress.org/?v=2.9.2 hourly 1 Comment on Bloom Filters by hobbes_dmS http://www.coolsnap.net/kevin/?p=13&cpage=1#comment-105 hobbes_dmS Mon, 18 Feb 2008 08:12:49 +0000 http://www.coolsnap.net/kevin/?p=13#comment-105 I noticed that you calculate the hashindices on each for-loop in your function _HashIndices(). If you except larger quantities of words (like >500.000) to be inserted into a big Bloomfilter (600kB Bitvec) you'll get an optimum number of 7 Hashfunctions... calculating 2 Hashvalues might then be a little faster than calculating 14 Hashvalues for each word ;) greetings I noticed that you calculate the hashindices on each for-loop in your function _HashIndices(). If you except larger quantities of words (like >500.000) to be inserted into a big Bloomfilter (600kB Bitvec) you’ll get an optimum number of 7 Hashfunctions… calculating 2 Hashvalues might then be a little faster than calculating 14 Hashvalues for each word ;)

greetings

]]> Comment on FYI by md http://www.coolsnap.net/kevin/?p=43&cpage=1#comment-7 md Sat, 21 Jul 2007 17:02:31 +0000 http://www.coolsnap.net/kevin/?p=43#comment-7 Congrats on the new gig. AdMob is doing great things and the team is first rate. I am a friend of the company and am happy to say that there are many former students and colleagues working there. Omar is a terrific CEO and continues to build a great team. Break a leg! Congrats on the new gig. AdMob is doing great things and the team is first rate. I am a friend of the company and am happy to say that there are many former students and colleagues working there. Omar is a terrific CEO and continues to build a great team. Break a leg!

]]> Comment on Linguistic Anthropology by cheesewz http://www.coolsnap.net/kevin/?p=26&cpage=1#comment-5 cheesewz Wed, 13 Jun 2007 18:27:10 +0000 http://www.coolsnap.net/kevin/?p=26#comment-5 This article was right on the money. Pretty much summed up my entire online community. This article was right on the money. Pretty much summed up my entire online community.

]]> Comment on Bloom Filters by Cool/Snap? » More Fun With Bloom Filters http://www.coolsnap.net/kevin/?p=13&cpage=1#comment-3 Cool/Snap? » More Fun With Bloom Filters Sat, 28 Apr 2007 22:44:37 +0000 http://www.coolsnap.net/kevin/?p=13#comment-3 [...] In my previous Bloom filter post, I talked about using Bloom filters for spell checking in memory constrained environments. With respect to problems like spell checking, contemporary machines can’t exactly be described as memory constrained. One can easily load a comprehensive language dictionary into a few megs of memory and store it in an ordinary hash table, trie, or other structure for efficient lookups. [...] [...] In my previous Bloom filter post, I talked about using Bloom filters for spell checking in memory constrained environments. With respect to problems like spell checking, contemporary machines can’t exactly be described as memory constrained. One can easily load a comprehensive language dictionary into a few megs of memory and store it in an ordinary hash table, trie, or other structure for efficient lookups. [...]

]]>