<?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 (jm)</title>
    <link>https://pinboard.in/u:jm/public/</link>
    <description>recent bookmarks from jm</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://www.stanford.edu/class/cs345a/slides/05-LSH.pdf"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://www.stanford.edu/class/cs345a/slides/05-LSH.pdf">
    <title>Near Neighbor Search in High Dimensional Data [PDF]</title>
    <dc:date>2012-02-22T11:27:39+00:00</dc:date>
    <link>http://www.stanford.edu/class/cs345a/slides/05-LSH.pdf</link>
    <dc:creator>jm</dc:creator><description><![CDATA[Detect near-duplicates; would be good for future Razor-like efficient near-duplicate detection.  (slides)]]></description>
<dc:subject>slides algorithms email performance programming near-neighbour-search search</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:5d1174b2c395/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:slides"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:email"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:near-neighbour-search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:search"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>