<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel rdf:about="http://blogmarks.net/api/marks/tag/hashing">
<title>Public marks with tag hashing</title>
<description>Public marks with tag hashing</description>
<link>http://blogmarks.net/marks/tag/hashing</link>
<items><rdf:Seq><rdf:li resource="http://blogmarks.net/api/user/sylvainulg/mark/1058157619"/>
<rdf:li resource="http://blogmarks.net/api/user/sylvainulg/mark/1057906748"/>
<rdf:li resource="http://blogmarks.net/api/user/CharlesNepote/mark/1057756610"/>
<rdf:li resource="http://blogmarks.net/api/user/benoit/mark/1057744815"/>
</rdf:Seq></items>
</channel>
<item rdf:about="http://blogmarks.net/api/user/sylvainulg/mark/1058157619">
<title>hash_functions [smallcode]</title>
<link>http://smallcode.weblogs.us/hash_functions</link>
<description>an interesting review of hash functions and their performance over different sets of keys.
Note that he measure the actual time for hashing + scanning through a collision list rather than just counting the numbers of collisions.</description>
<dc:date>2009-01-12T11:11:06Z</dc:date>
<dc:author>sylvainulg</dc:author>
<dc:subject>programming, hashing, tutorial, research</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://smallcode.weblogs.us/hash_functions"><img border="0" src="http://blogmarks.net/screenshots/2009/01/12/e9a2529cc20d12d5c85ee346cf2d00b7.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://smallcode.weblogs.us/hash_functions">hash_functions [smallcode]</a></h4>
 
by <a href="http://blogmarks.net/user/sylvainulg">sylvainulg</a> 
<p class="description">an interesting review of hash functions and their performance over different sets of keys.
Note that he measure the actual time for hashing + scanning through a collision list rather than just counting the numbers of collisions.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/programming">programming</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hashing">hashing</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tutorial">tutorial</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/research">research</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1058157619">Copy</a> | 
<a href="http://blogmarks.net/link/3055452">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/sylvainulg/mark/1057906748">
<title>Bloom filter - Wikipedia, the free encyclopedia</title>
<link>http://en.wikipedia.org/wiki/Bloom_filter#CITEREFPutzeSandersSingler2007</link>
<description>state of the art (hopefully)</description>
<dc:date>2008-07-04T16:09:19Z</dc:date>
<dc:author>sylvainulg</dc:author>
<dc:subject>bloom filter, hashing, data structures, programming, networking</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://en.wikipedia.org/wiki/Bloom_filter#CITEREFPutzeSandersSingler2007"><img border="0" src="http://blogmarks.net/screenshots/2008/07/04/7ccf7433c6f0eae0ecf653583f440980.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://en.wikipedia.org/wiki/Bloom_filter#CITEREFPutzeSandersSingler2007">Bloom filter - Wikipedia, the free encyclopedia</a></h4>
 
by <a href="http://blogmarks.net/user/sylvainulg">sylvainulg</a> 
<p class="description">state of the art (hopefully)</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/bloom%2Bfilter">bloom filter</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hashing">hashing</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/data%2Bstructures">data structures</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/programming">programming</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/networking">networking</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057906748">Copy</a> | 
<a href="http://blogmarks.net/link/2831136">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/CharlesNepote/mark/1057756610">
<title>PwdHash</title>
<link>http://crypto.stanford.edu/PwdHash/</link>
<description>PwdHash is an browser extension that transparently converts a user's password into a domain-specific password.</description>
<dc:date>2008-03-28T15:32:16Z</dc:date>
<dc:author>CharlesNepote</dc:author>
<dc:subject>mot de passe, phishing, cryptage, hashing, hash, password</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://crypto.stanford.edu/PwdHash/"><img border="0" src="http://blogmarks.net/screenshots/2008/03/28/a016cb839c0fbe020067014354ff1b39.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://crypto.stanford.edu/PwdHash/">PwdHash</a></h4>
 
by <a href="http://blogmarks.net/user/CharlesNepote">CharlesNepote</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/205491">4 other(s)</a> 
<p class="description">PwdHash is an browser extension that transparently converts a user's password into a domain-specific password.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/mot%2Bde%2Bpasse">mot de passe</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/phishing">phishing</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/cryptage">cryptage</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hashing">hashing</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hash">hash</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/password">password</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057756610">Copy</a> | 
<a href="http://blogmarks.net/link/205491">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/benoit/mark/1057744815">
<title>Programmer’s Toolbox Part 3: Consistent Hashing | Spiteful.com</title>
<link>http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/</link>
<description>Je suis sur que ca passionera Gandour...</description>
<dc:date>2008-03-19T20:56:46Z</dc:date>
<dc:author>benoit</dc:author>
<dc:subject>Algorithm, hashing</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/"><img border="0" src="http://blogmarks.net/screenshots/2008/03/19/f6f3cb1a97ac22a91dc5342c1b213857.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/">Programmer’s Toolbox Part 3: Consistent Hashing | Spiteful.com</a></h4>
 
by <a href="http://blogmarks.net/user/benoit">benoit</a> 
<p class="description">Je suis sur que ca passionera Gandour...</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/Algorithm">Algorithm</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hashing">hashing</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057744815">Copy</a> | 
<a href="http://blogmarks.net/link/2709614">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> </rdf:RDF>