<?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 (bgporter)</title>
    <link>https://pinboard.in/u:bgporter/public/</link>
    <description>recent bookmarks from bgporter</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://neuralnetworksanddeeplearning.com/index.html"/>
	<rdf:li rdf:resource="http://www.ru.is/faculty/ulfar/CuckooHash.pdf"/>
	<rdf:li rdf:resource="http://www.nedprod.com/programs/portable/nedtries/"/>
	<rdf:li rdf:resource="http://cnx.org/content/m11714/latest/"/>
	<rdf:li rdf:resource="http://graphics.stanford.edu/~seander/bithacks.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://neuralnetworksanddeeplearning.com/index.html">
    <title>Neural networks and deep learning</title>
    <dc:date>2013-11-26T14:17:30+00:00</dc:date>
    <link>http://neuralnetworksanddeeplearning.com/index.html</link>
    <dc:creator>bgporter</dc:creator><description><![CDATA[Neural Networks and Deep Learning is a free online book. The book will teach you about:

    Neural networks, a beautiful biologically-inspired programming paradigm which enables a computer to learn from observational data
    Deep learning, a powerful set of techniques for learning in neural networks 

Neural networks and deep learning currently provide the best solutions to many problems in image recognition, speech recognition, and natural language processing. This book will teach you all the core concepts behind neural networks and deep learning. 

(Note -- there's an indiegogo campaign to support the writing of this book)]]></description>
<dc:subject>algorithms book neural-nets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bgporter/b:a4de41427d53/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:neural-nets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ru.is/faculty/ulfar/CuckooHash.pdf">
    <title>A Cool and Practical Alternative to Traditional Hash Tables</title>
    <dc:date>2011-02-20T14:23:40+00:00</dc:date>
    <link>http://www.ru.is/faculty/ulfar/CuckooHash.pdf</link>
    <dc:creator>bgporter</dc:creator><dc:subject>programming algorithms toread</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bgporter/b:d2fa5ccf15ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:toread"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nedprod.com/programs/portable/nedtries/">
    <title>ned Productions - nedtries</title>
    <dc:date>2011-01-16T16:02:44+00:00</dc:date>
    <link>http://www.nedprod.com/programs/portable/nedtries/</link>
    <dc:creator>bgporter</dc:creator><description><![CDATA[So what if I told you that for the very common case of a pointer sized key lookup that the standard assumptions are wrong? What if there was an algorithm which provides nearly all the advantages of ordered indexation such as closest fit finds, except it has nearly O(1) complexity rather than O(log N) and is therefore 100% faster? What if, in fact, this algorithm is a good 20% faster than the typical O(1) hash table implementation for medium sized collections and is no slower even at 10,000 items?]]></description>
<dc:subject>algorithms c++</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bgporter/b:a80fde067a3d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:c++"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://cnx.org/content/m11714/latest/">
    <title>Pitch Detection Algorithms</title>
    <dc:date>2008-09-24T20:14:40+00:00</dc:date>
    <link>http://cnx.org/content/m11714/latest/</link>
    <dc:creator>bgporter</dc:creator><dc:subject>dsp pitch algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:bgporter/b:ba729405efde/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:dsp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:pitch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://graphics.stanford.edu/~seander/bithacks.html">
    <title>Bit Twiddling Hacks</title>
    <dc:date>2007-07-17T15:48:49+00:00</dc:date>
    <link>http://graphics.stanford.edu/~seander/bithacks.html</link>
    <dc:creator>bgporter</dc:creator><dc:subject>programming algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:bgporter/b:68beb47fb3d8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bgporter/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>