<?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 (threedaymonk)</title>
    <link>https://pinboard.in/u:threedaymonk/public/</link>
    <description>recent bookmarks from threedaymonk</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://roaringbitmap.org/"/>
	<rdf:li rdf:resource="https://graphics.stanford.edu/~seander/bithacks.html"/>
	<rdf:li rdf:resource="http://thesecretlivesofdata.com/raft/"/>
	<rdf:li rdf:resource="http://williamedwardscoder.tumblr.com/post/87682811573/compressing-scrabble-dictionaries"/>
	<rdf:li rdf:resource="http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html"/>
	<rdf:li rdf:resource="http://johanneskopf.de/publications/pixelart/index.html"/>
	<rdf:li rdf:resource="http://chaosinmotion.com/blog/?p=622"/>
	<rdf:li rdf:resource="http://www.cleveralgorithms.com/"/>
	<rdf:li rdf:resource="http://laplacian.wordpress.com/2009/01/10/how-shazam-works/"/>
	<rdf:li rdf:resource="http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/"/>
	<rdf:li rdf:resource="http://www.robweir.com/blog/2010/02/microsoft-random-browser-ballot.html"/>
	<rdf:li rdf:resource="http://eli.thegreenplace.net/2010/01/02/top-down-operator-precedence-parsing/"/>
	<rdf:li rdf:resource="http://gandolf.homelinux.org/~smhanov/blog/?id=63"/>
	<rdf:li rdf:resource="http://www.htdp.org/"/>
	<rdf:li rdf:resource="http://artisansystem.com/blog/entry/36"/>
	<rdf:li rdf:resource="http://www.evanmiller.org/how-not-to-sort-by-average-rating.html"/>
	<rdf:li rdf:resource="http://code.google.com/p/daisydiff/"/>
	<rdf:li rdf:resource="http://www.nathanm.com/photoshop-blending-math/"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Geohash"/>
	<rdf:li rdf:resource="http://plan9.bell-labs.com/sys/doc/venti.pdf"/>
	<rdf:li rdf:resource="http://make3d.stanford.edu/"/>
	<rdf:li rdf:resource="http://www.jjj.de/fxt/#fxtbook"/>
	<rdf:li rdf:resource="http://lemonodor.com/archives/2008/02/protecting_journalistic_integrity_algorithmically.html"/>
	<rdf:li rdf:resource="http://www.hpl.hp.com/techreports/2007/HPL-2007-193.html?mtxs=rss-hpl-tr"/>
	<rdf:li rdf:resource="http://playtechs.blogspot.com/2007/12/boobs-booty-and-booze-adventures-in.html"/>
	<rdf:li rdf:resource="http://portal.acm.org/citation.cfm?id=1281192.1281206&amp;coll=GUIDE&amp;dl=&amp;type=series&amp;idx=1281192&amp;part=Proceedings&amp;WantType=Proceedings&amp;title=Conference%20on%20Knowledge%20Discovery%20in%20Data&amp;CFID=15151515&amp;CFTOKEN=6184618"/>
	<rdf:li rdf:resource="http://software.wise-guys.nl/libtextcat/"/>
	<rdf:li rdf:resource="http://www.dcc.uchile.cl/~gnavarro/ps/spire98.2.ps.gz"/>
	<rdf:li rdf:resource="http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html"/>
	<rdf:li rdf:resource="http://antigrain.com/research/font_rasterization/index.html"/>
	<rdf:li rdf:resource="http://www.datastructures.info/"/>
	<rdf:li rdf:resource="http://projecteuler.net/"/>
	<rdf:li rdf:resource="http://swiss.csail.mit.edu/classes/6.001/abelson-sussman-lectures/"/>
	<rdf:li rdf:resource="http://mitpress.mit.edu/sicp/"/>
	<rdf:li rdf:resource="http://www.nist.gov/dads/index.html"/>
	<rdf:li rdf:resource="http://www.dangermouse.net/esoteric/intelligentdesignsort.html"/>
	<rdf:li rdf:resource="http://eigenclass.org/hiki.rb?eigenclass.org+node+classification#f01"/>
	<rdf:li rdf:resource="http://www.ddj.com/article/printableArticle.jhtml;jsessionid=Q1TDPZ3GYL5M2QSNDLPSKHSCJUNN2JVN?articleID=184406478&amp;dept_url=/dept/ai/"/>
	<rdf:li rdf:resource="http://graphics.stanford.edu/~seander/bithacks.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://roaringbitmap.org/">
    <title>Roaring Bitmaps</title>
    <dc:date>2022-11-17T08:15:49+00:00</dc:date>
    <link>http://roaringbitmap.org/</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>compression bitmap algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:de84a000d3e3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:bitmap"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://graphics.stanford.edu/~seander/bithacks.html">
    <title>Bit Twiddling Hacks</title>
    <dc:date>2020-01-21T22:07:39+00:00</dc:date>
    <link>https://graphics.stanford.edu/~seander/bithacks.html</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms c programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:0bafb46ecfef/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:c"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://thesecretlivesofdata.com/raft/">
    <title>Raft</title>
    <dc:date>2015-08-19T09:39:40+00:00</dc:date>
    <link>http://thesecretlivesofdata.com/raft/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Animated explanation of the Raft distributed consensus algorithm.]]></description>
<dc:subject>raft algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:2d13e76e701e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:raft"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://williamedwardscoder.tumblr.com/post/87682811573/compressing-scrabble-dictionaries">
    <title>Compressing Scrabble Dictionaries</title>
    <dc:date>2014-07-11T05:47:20+00:00</dc:date>
    <link>http://williamedwardscoder.tumblr.com/post/87682811573/compressing-scrabble-dictionaries</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms compression datastructures scrabble</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:49f534460952/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:scrabble"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html">
    <title>Introduction to A*</title>
    <dc:date>2014-04-15T11:48:00+00:00</dc:date>
    <link>http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms compsci</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:eeb18cad9d57/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://johanneskopf.de/publications/pixelart/index.html">
    <title>Depixelizing Pixel Art</title>
    <dc:date>2011-05-25T15:54:46+00:00</dc:date>
    <link>http://johanneskopf.de/publications/pixelart/index.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘We describe a novel algorithm for extracting a resolution-independent vector representation from pixel art images’.]]></description>
<dc:subject>graphics algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:046e4229ac62/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://chaosinmotion.com/blog/?p=622">
    <title>How (not) to write Factorial in Java.</title>
    <dc:date>2011-01-26T16:57:24+00:00</dc:date>
    <link>http://chaosinmotion.com/blog/?p=622</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘perhaps the right answer is using Gergo Nemes’s approximation to Stirling’s approximation to the Gamma Function … But it depends on the domain’.]]></description>
<dc:subject>programming algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:a2619e81fa08/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cleveralgorithms.com/">
    <title>Clever Algorithms</title>
    <dc:date>2011-01-25T23:20:01+00:00</dc:date>
    <link>http://www.cleveralgorithms.com/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[45 nature-inspired algorithms with code examples in Ruby.]]></description>
<dc:subject>ai algorithms programming books ebooks ruby</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:7bd17cb4ae83/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:ebooks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:ruby"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://laplacian.wordpress.com/2009/01/10/how-shazam-works/">
    <title>How Shazam Works</title>
    <dc:date>2010-07-08T15:16:58+00:00</dc:date>
    <link>http://laplacian.wordpress.com/2009/01/10/how-shazam-works/</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms audio sound music</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:149b9ad0f592/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:audio"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:sound"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:music"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/">
    <title>Evolving Faster Haskell Programs (now with LLVM!)</title>
    <dc:date>2010-03-01T12:15:45+00:00</dc:date>
    <link>http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘In which I use genetic algorithms to search for optimal LLVM optimizer passes to make Haskell programs faster’ with impressive results.
]]></description>
<dc:subject>ga algorithms haskell llvm compiler optimisation</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:d8a28aae26b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:ga"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:llvm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compiler"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:optimisation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.robweir.com/blog/2010/02/microsoft-random-browser-ballot.html">
    <title>Doing the Microsoft Shuffle</title>
    <dc:date>2010-02-28T11:19:03+00:00</dc:date>
    <link>http://www.robweir.com/blog/2010/02/microsoft-random-browser-ballot.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Microsoft’s browser choice site fails to be truly random because it uses a biased naïve shuffle algorithm. Ironically, this is to IE’s detriment.
]]></description>
<dc:subject>microsoft browser sort random shuffle algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:f6dd4c79c28b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:microsoft"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:browser"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:sort"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:random"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:shuffle"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eli.thegreenplace.net/2010/01/02/top-down-operator-precedence-parsing/">
    <title>Top-Down operator precedence parsing</title>
    <dc:date>2010-01-09T21:49:31+00:00</dc:date>
    <link>http://eli.thegreenplace.net/2010/01/02/top-down-operator-precedence-parsing/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘this article is my usual attempt to explain the topic to myself’
]]></description>
<dc:subject>programming algorithms parser</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:d8750b3eb655/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:parser"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://gandolf.homelinux.org/~smhanov/blog/?id=63">
    <title>Keeping Abreast of Pornographic Research in Computer Science</title>
    <dc:date>2009-04-25T21:44:38+00:00</dc:date>
    <link>http://gandolf.homelinux.org/~smhanov/blog/?id=63</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘It is evident from his web page that he has a sense of humour, which explains the superbly descriptive title for his 1996 paper, Finding Naked People.’
]]></description>
<dc:subject>weird compsci humour porn algorithms research</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:84fa1ceca977/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:weird"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:humour"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:porn"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:research"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.htdp.org/">
    <title>How to Design Programs</title>
    <dc:date>2009-04-24T13:50:24+00:00</dc:date>
    <link>http://www.htdp.org/</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>programming education books ebooks algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:594edf497785/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:education"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:ebooks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://artisansystem.com/blog/entry/36">
    <title>On Building an Efficient, Indexed Search Engine With a Word Proximity Algorithm</title>
    <dc:date>2009-03-07T00:25:58+00:00</dc:date>
    <link>http://artisansystem.com/blog/entry/36</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms search compsci text</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:20826fece9df/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:text"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.evanmiller.org/how-not-to-sort-by-average-rating.html">
    <title>How Not To Sort By Average Rating</title>
    <dc:date>2009-02-12T18:43:15+00:00</dc:date>
    <link>http://www.evanmiller.org/how-not-to-sort-by-average-rating.html</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>webdev usability algorithms statistics mathematics</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:c50d42a739bf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:webdev"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:usability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://code.google.com/p/daisydiff/">
    <title>daisydiff</title>
    <dc:date>2008-10-30T08:09:16+00:00</dc:date>
    <link>http://code.google.com/p/daisydiff/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘Daisy Diff is a Java library that diffs (compares) HTML files.’ A PHP implementation is also available.
]]></description>
<dc:subject>webdev html diff java php algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:96dda9677415/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:webdev"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:html"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:diff"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:java"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:php"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nathanm.com/photoshop-blending-math/">
    <title>Photoshop Blend Mode Math</title>
    <dc:date>2008-06-11T10:29:14+00:00</dc:date>
    <link>http://www.nathanm.com/photoshop-blending-math/</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms c graphics photoshop colour</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:bd153e04740b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:c"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:photoshop"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:colour"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Geohash">
    <title>Geohash</title>
    <dc:date>2008-05-24T20:39:11+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Geohash</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Geocoding system offering arbitrary precision and detection of close locations by prefix matching.
]]></description>
<dc:subject>algorithms geocoding maps</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:3e607f09a80f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:geocoding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:maps"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://plan9.bell-labs.com/sys/doc/venti.pdf">
    <title>Venti: a new approach to archival storage</title>
    <dc:date>2008-04-15T13:00:15+00:00</dc:date>
    <link>http://plan9.bell-labs.com/sys/doc/venti.pdf</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[A write-once system using hashes of data blocks to identify them.
]]></description>
<dc:subject>algorithms datastructures backup filesystem compsci</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:6c7cfa1c567d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:backup"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:filesystem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://make3d.stanford.edu/">
    <title>Make3D: convert your image into 3d</title>
    <dc:date>2008-03-08T23:49:19+00:00</dc:date>
    <link>http://make3d.stanford.edu/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Very clever: it converts a single 2D photo into a 3D model.
]]></description>
<dc:subject>3d algorithms graphics photography</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:08710f8b37a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:3d"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:photography"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.jjj.de/fxt/#fxtbook">
    <title>Jörg's useful and ugly FXT page</title>
    <dc:date>2008-03-06T08:48:48+00:00</dc:date>
    <link>http://www.jjj.de/fxt/#fxtbook</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Includes the ‘Algorithms for programmers’ book.
]]></description>
<dc:subject>algorithms mathematics graphics reference books</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:f73c0603e666/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:books"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://lemonodor.com/archives/2008/02/protecting_journalistic_integrity_algorithmically.html">
    <title>Protecting Journalistic Integrity Algorithmically</title>
    <dc:date>2008-02-29T11:05:08+00:00</dc:date>
    <link>http://lemonodor.com/archives/2008/02/protecting_journalistic_integrity_algorithmically.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Discussion, code, and examples of detecting copy-move forgery in images.
]]></description>
<dc:subject>algorithms graphics image image-processing journalism</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:eb72bf8cdb3f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:image"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:image-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:journalism"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.hpl.hp.com/techreports/2007/HPL-2007-193.html?mtxs=rss-hpl-tr">
    <title>A practical scalable distributed B-tree</title>
    <dc:date>2008-01-07T15:25:24+00:00</dc:date>
    <link>http://www.hpl.hp.com/techreports/2007/HPL-2007-193.html?mtxs=rss-hpl-tr</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>database data programming algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:18ded28b9c46/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://playtechs.blogspot.com/2007/12/boobs-booty-and-booze-adventures-in.html">
    <title>Boobs, Booty, and Booze: Adventures In Edit Distance</title>
    <dc:date>2007-12-13T22:08:57+00:00</dc:date>
    <link>http://playtechs.blogspot.com/2007/12/boobs-booty-and-booze-adventures-in.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Solving a word puzzle.
]]></description>
<dc:subject>algorithms language</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:1f0264a01fee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:language"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://portal.acm.org/citation.cfm?id=1281192.1281206&amp;coll=GUIDE&amp;dl=&amp;type=series&amp;idx=1281192&amp;part=Proceedings&amp;WantType=Proceedings&amp;title=Conference%20on%20Knowledge%20Discovery%20in%20Data&amp;CFID=15151515&amp;CFTOKEN=6184618">
    <title>Modeling relationships at multiple scales to improve accuracy of large recommender systems</title>
    <dc:date>2007-11-18T22:42:57+00:00</dc:date>
    <link>http://portal.acm.org/citation.cfm?id=1281192.1281206&amp;coll=GUIDE&amp;dl=&amp;type=series&amp;idx=1281192&amp;part=Proceedings&amp;WantType=Proceedings&amp;title=Conference%20on%20Knowledge%20Discovery%20in%20Data&amp;CFID=15151515&amp;CFTOKEN=6184618</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Details of the recommendation algorithm that won the Netflix progress prize.
]]></description>
<dc:subject>algorithms recommendation compsci</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:cd083110ad72/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:recommendation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://software.wise-guys.nl/libtextcat/">
    <title>libTextCat</title>
    <dc:date>2007-10-24T10:51:31+00:00</dc:date>
    <link>http://software.wise-guys.nl/libtextcat/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Implementation of Cavner & Trenkle’s n-gram-based text categorisation algorithm. Very good at language guessing.
]]></description>
<dc:subject>classification algorithms linguistics library open-source</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:d5300a79fbcf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:linguistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:open-source"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.dcc.uchile.cl/~gnavarro/ps/spire98.2.ps.gz">
    <title>Fast Approximate String Matching in a Dictionary</title>
    <dc:date>2007-10-23T14:11:55+00:00</dc:date>
    <link>http://www.dcc.uchile.cl/~gnavarro/ps/spire98.2.ps.gz</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>compsci algorithms reevoo-developer</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:037d023507f6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:reevoo-developer"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html">
    <title>Damn Cool Algorithms, Part 1: BK-Trees</title>
    <dc:date>2007-10-20T09:56:15+00:00</dc:date>
    <link>http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Near-match searching using a tree built from the Levenshtein distance.
]]></description>
<dc:subject>algorithms compsci</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:f7c4b38210d5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://antigrain.com/research/font_rasterization/index.html">
    <title>Texts Rasterization Exposures</title>
    <dc:date>2007-07-24T11:56:37+00:00</dc:date>
    <link>http://antigrain.com/research/font_rasterization/index.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Very interesting research on font rasterisation and sub-pixel anti-aliasing.
]]></description>
<dc:subject>fonts algorithms windows linux graphics typography osx</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:6ec93f76abc9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:fonts"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:windows"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:linux"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:typography"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:osx"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.datastructures.info/">
    <title>DataStructures</title>
    <dc:date>2007-04-15T19:41:05+00:00</dc:date>
    <link>http://www.datastructures.info/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[A blog about data structures.
]]></description>
<dc:subject>blogs compsci datastructures algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:be5dd1ef70ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuler.net/">
    <title>Project Euler</title>
    <dc:date>2007-03-14T23:16:37+00:00</dc:date>
    <link>http://projecteuler.net/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘A series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve.’
]]></description>
<dc:subject>algorithms compsci programming education</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:023099657933/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:education"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://swiss.csail.mit.edu/classes/6.001/abelson-sussman-lectures/">
    <title>Structure and Interpretation of Computer Programs, Video Lectures</title>
    <dc:date>2007-03-14T09:42:27+00:00</dc:date>
    <link>http://swiss.csail.mit.edu/classes/6.001/abelson-sussman-lectures/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘These twenty video lectures by Hal Abelson and Gerald Jay Sussman are a complete presentation of the course, given in July 1986 for Hewlett-Packard employees.’
]]></description>
<dc:subject>algorithms compsci computing video programming education</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:7dbc0c950149/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:video"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:education"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mitpress.mit.edu/sicp/">
    <title>Structure and Interpretation of Computer Programs</title>
    <dc:date>2007-03-14T09:40:32+00:00</dc:date>
    <link>http://mitpress.mit.edu/sicp/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[The full book and its supporting materials.
]]></description>
<dc:subject>algorithms compsci computing programming reference books</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:80d00d14e844/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:books"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nist.gov/dads/index.html">
    <title>Dictionary of Algorithms and Data Structures</title>
    <dc:date>2007-02-15T18:07:03+00:00</dc:date>
    <link>http://www.nist.gov/dads/index.html</link>
    <dc:creator>threedaymonk</dc:creator><dc:subject>algorithms programming reference datastructures</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:d92757246c47/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:datastructures"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.dangermouse.net/esoteric/intelligentdesignsort.html">
    <title>Intelligent Design Sort</title>
    <dc:date>2006-12-04T08:06:28+00:00</dc:date>
    <link>http://www.dangermouse.net/esoteric/intelligentdesignsort.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘[A] sorting algorithm based on the theory of intelligent design.’
]]></description>
<dc:subject>programming humour satire algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:3754892a30e2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:humour"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:satire"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eigenclass.org/hiki.rb?eigenclass.org+node+classification#f01">
    <title>Accessing the non-perishable information on eigenclass.org</title>
    <dc:date>2006-11-21T14:57:01+00:00</dc:date>
    <link>http://eigenclass.org/hiki.rb?eigenclass.org+node+classification#f01</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[A simple but effective formula for classifying information by popularity and newness.
]]></description>
<dc:subject>algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:a08167b03ed6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ddj.com/article/printableArticle.jhtml;jsessionid=Q1TDPZ3GYL5M2QSNDLPSKHSCJUNN2JVN?articleID=184406478&amp;dept_url=/dept/ai/">
    <title>An Algorithm for Compressing Space and Time</title>
    <dc:date>2006-07-21T14:28:27+00:00</dc:date>
    <link>http://www.ddj.com/article/printableArticle.jhtml;jsessionid=Q1TDPZ3GYL5M2QSNDLPSKHSCJUNN2JVN?articleID=184406478&amp;dept_url=/dept/ai/</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[‘HashLife is a unique algorithm consisting of memoization of the Life next-generation function applied to a quadtree representation of the universe.’
]]></description>
<dc:subject>programming algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:1b90bc01f02c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://graphics.stanford.edu/~seander/bithacks.html">
    <title>Bit Twiddling Hacks</title>
    <dc:date>2006-04-04T20:54:45+00:00</dc:date>
    <link>http://graphics.stanford.edu/~seander/bithacks.html</link>
    <dc:creator>threedaymonk</dc:creator><description><![CDATA[Handy.
]]></description>
<dc:subject>programming algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:threedaymonk/b:ac7e62377a8e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:threedaymonk/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>