<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (torsten)</title>
    <link>https://pinboard.in/u:torsten/public/</link>
    <description>recent bookmarks from torsten</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://swtch.com/~rsc/regexp/regexp4.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2110.01111"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/K-anonymity"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/SimHash"/>
	<rdf:li rdf:resource="http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed/145633#145633"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Tf%E2%80%93idf"/>
	<rdf:li rdf:resource="http://norvig.com/ipod.html"/>
	<rdf:li rdf:resource="http://www.quora.com/How-would-you-programmatically-parse-a-sentence-and-decide-whether-to-answer-thats-what-she-said"/>
	<rdf:li rdf:resource="http://attractivechaos.awardspace.com/"/>
	<rdf:li rdf:resource="http://volnitsky.com/project/str_search/"/>
	<rdf:li rdf:resource="http://stevehanov.ca/blog/index.php?id=114"/>
	<rdf:li rdf:resource="http://www.bramstein.com/projects/typeset/"/>
	<rdf:li rdf:resource="http://structuresynth.sourceforge.net/"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~quake/triangle.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://swtch.com/~rsc/regexp/regexp4.html">
    <title>Regular Expression Matching with a Trigram Index</title>
    <dc:date>2023-02-05T02:46:06+00:00</dc:date>
    <link>https://swtch.com/~rsc/regexp/regexp4.html</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[How Google Code Search Worked
By Russ Cox ]]></description>
<dc:subject>algorithm google programming search regex 2012 software engineering</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:992dc368b9a9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:regex"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:2012"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:software"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:engineering"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2110.01111">
    <title>arXiv: Is this the simplest (and most surprising) sorting algorithm ever?</title>
    <dc:date>2021-10-07T16:40:03+00:00</dc:date>
    <link>https://arxiv.org/abs/2110.01111</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[for i = 1 to n do
   for j = 1 to n do
      if A[i] < A[j] then
         swap A[i] and A[j]]]></description>
<dc:subject>algorithm coding development sorting cs .via:hn</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:c3fd19acc3db/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:coding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:development"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:sorting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:cs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:.via:hn"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/K-anonymity">
    <title>k-anonymity - Wikipedia</title>
    <dc:date>2021-04-06T01:57:02+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/K-anonymity</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[k-anonymity received widespread media coverage in 2018 when British computer scientist Junade Ali used the property alongside cryptographic hashing to create a communication protocol to anonymously verify if a password was leaked without disclosing the searched password. This protocol was implemented as a public API in Troy Hunt's Have I Been Pwned? service and is consumed by multiple services including password managers and browser extensions.]]></description>
<dc:subject>security privacy wikipedia hack algorithm hashing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:09ea4c402b7d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:wikipedia"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hack"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hashing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/SimHash">
    <title>SimHash - Wikipedia</title>
    <dc:date>2021-03-06T02:36:41+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/SimHash</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[hashing algorithm where similar items are hashed to similar hash values. used by google for duplicate detection in web crawling]]></description>
<dc:subject>cs computer science hash hashing algorithm data wikipedia google web information</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:79cf85727b34/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:cs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:computer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hash"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:wikipedia"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:web"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:information"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed/145633#145633">
    <title>Which hashing algorithm is best for uniqueness and speed? - Programmers</title>
    <dc:date>2012-06-25T20:01:20+00:00</dc:date>
    <link>http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed/145633#145633</link>
    <dc:creator>torsten</dc:creator><dc:subject>hashing hash algorithm algorithms programming benchmark</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:336c751a69b8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hash"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:benchmark"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Tf%E2%80%93idf">
    <title>tf–idf - Wikipedia</title>
    <dc:date>2012-02-05T21:55:48+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Tf%E2%80%93idf</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[term frequency–inverse document frequency: how to find relavant terms from a set of overlapping terms]]></description>
<dc:subject>algorithm data datamining nlp wikipedia geo wp</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:f737fedfbab7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:datamining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:wikipedia"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:geo"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:wp"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://norvig.com/ipod.html">
    <title>Doing the Martin Shuffle (with your iPod)</title>
    <dc:date>2011-11-29T15:56:27+00:00</dc:date>
    <link>http://norvig.com/ipod.html</link>
    <dc:creator>torsten</dc:creator><description><![CDATA[peter norvig applies markov decision processes (MDPs) to figure out how efficient a randomized algorithm is]]></description>
<dc:subject>ml ai machine learning algorithm algorithms ipod programming python</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:fc9aefcd32fc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:ml"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:machine"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:ipod"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:python"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.quora.com/How-would-you-programmatically-parse-a-sentence-and-decide-whether-to-answer-thats-what-she-said">
    <title>How would you programmatically parse a sentence and decide whether to answer &quot;that's what she said&quot;? - Quora</title>
    <dc:date>2011-04-29T09:00:42+00:00</dc:date>
    <link>http://www.quora.com/How-would-you-programmatically-parse-a-sentence-and-decide-whether-to-answer-thats-what-she-said</link>
    <dc:creator>torsten</dc:creator><dc:subject>algorithm challenge design ai ml irc bot</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:beb28a30a3e4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:challenge"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:ml"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:irc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:bot"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://attractivechaos.awardspace.com/">
    <title>C macro libraries</title>
    <dc:date>2011-03-13T22:00:42+00:00</dc:date>
    <link>http://attractivechaos.awardspace.com/</link>
    <dc:creator>torsten</dc:creator><dc:subject>c c++ macro algorithm hash tree sorting sort library</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:1689b4d61920/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:c"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:macro"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:hash"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:tree"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:sorting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:sort"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:library"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://volnitsky.com/project/str_search/">
    <title>Substring search algorithm</title>
    <dc:date>2011-02-13T17:33:30+00:00</dc:date>
    <link>http://volnitsky.com/project/str_search/</link>
    <dc:creator>torsten</dc:creator><dc:subject>c++ algorithms algorithm substring string search</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:0ced4ab71005/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:substring"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:string"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:search"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stevehanov.ca/blog/index.php?id=114">
    <title>Fast and Easy Levenshtein distance using a Trie - Steve Hanov's Programming Blog</title>
    <dc:date>2011-01-24T23:01:58+00:00</dc:date>
    <link>http://stevehanov.ca/blog/index.php?id=114</link>
    <dc:creator>torsten</dc:creator><dc:subject>py python algorithm algorithms programming search edit levenshtein distance blog</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:torsten/b:a717a261c1fa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:py"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:edit"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:levenshtein"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:blog"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.bramstein.com/projects/typeset/">
    <title>TypeSet</title>
    <dc:date>2010-12-10T11:24:28+00:00</dc:date>
    <link>http://www.bramstein.com/projects/typeset/</link>
    <dc:creator>torsten</dc:creator><description><![CDATA["implementation of the knuth and plass line breaking algorithm using javaScript and the html5 canvas element"
]]></description>
<dc:subject>tex html html5 typography algorithm web type</dc:subject>
<dc:identifier>https://pinboard.in/u:torsten/b:6afea8527842/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:tex"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:html"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:html5"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:typography"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:web"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:type"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://structuresynth.sourceforge.net/">
    <title>Structure Synth</title>
    <dc:date>2010-10-06T12:28:53+00:00</dc:date>
    <link>http://structuresynth.sourceforge.net/</link>
    <dc:creator>torsten</dc:creator><dc:subject>3d c++ art algorithm code design framework generator graphics opengl processing qt visualization</dc:subject>
<dc:identifier>https://pinboard.in/u:torsten/b:98618d859034/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:3d"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:art"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:code"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:framework"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:generator"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:opengl"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:qt"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:visualization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~quake/triangle.html">
    <title>Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator</title>
    <dc:date>2010-09-20T12:31:59+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~quake/triangle.html</link>
    <dc:creator>torsten</dc:creator><dc:subject>triangulation command line tool algorithms 3d 2d generator visualization vector algorithm delaunay</dc:subject>
<dc:identifier>https://pinboard.in/u:torsten/b:54d3c798644e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:triangulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:command"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:line"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:tool"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:3d"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:2d"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:generator"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:vector"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:torsten/t:delaunay"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>