<?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 (brandtkurowski)</title>
    <link>https://pinboard.in/u:brandtkurowski/public/</link>
    <description>recent bookmarks from brandtkurowski</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://theory.csail.mit.edu/~edemaine/papers/ALENEX2001/"/>
	<rdf:li rdf:resource="http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/wea06.pdf"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://theory.csail.mit.edu/~edemaine/papers/ALENEX2001/">
    <title>Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro: Experiments on Adaptive Set Intersections for Text Retrieval Systems</title>
    <dc:date>2007-03-07T23:05:13+00:00</dc:date>
    <link>http://theory.csail.mit.edu/~edemaine/papers/ALENEX2001/</link>
    <dc:creator>brandtkurowski</dc:creator><description><![CDATA[adaptive algorithm for computing the intersection of k sorted sets...model with an encoding of the shortest proof of the answer...performs better for “burstier” inputs than a worst-case optimal method...explores how algorithm behaves under actual data
]]></description>
<dc:subject>search index adaptive</dc:subject>
<dc:identifier>https://pinboard.in/u:brandtkurowski/b:6d4fd1fa6f7f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:index"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:adaptive"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/wea06.pdf">
    <title>Faster Adaptive Set Intersections for Text Searching</title>
    <dc:date>2007-03-07T23:00:17+00:00</dc:date>
    <link>http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/wea06.pdf</link>
    <dc:creator>brandtkurowski</dc:creator><description><![CDATA[intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, which improves over those proposed by Demaine, Munro and López-Orti
]]></description>
<dc:subject>search index intersection interpolation adaptive</dc:subject>
<dc:identifier>https://pinboard.in/u:brandtkurowski/b:b52697972c6f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:index"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:intersection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:interpolation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:brandtkurowski/t:adaptive"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>