<?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 (mncaudill)</title>
    <link>https://pinboard.in/u:mncaudill/public/</link>
    <description>recent bookmarks from mncaudill</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://www.brianfrankcooper.net/pubs/follows.pdf"/>
	<rdf:li rdf:resource="http://mlg.ucd.ie/files/summer/tutorial.pdf"/>
	<rdf:li rdf:resource="http://www.eecs.harvard.edu/~michaelm/postscripts/kdd2009.pdf"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://www.brianfrankcooper.net/pubs/follows.pdf">
    <title>Feeding Frenzy: Selectively Materializing Users’ Event Feeds</title>
    <dc:date>2011-11-01T23:59:31+00:00</dc:date>
    <link>http://www.brianfrankcooper.net/pubs/follows.pdf</link>
    <dc:creator>mncaudill</dc:creator><dc:subject>social graph</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mncaudill/b:c71cd907939d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:social"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:graph"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mlg.ucd.ie/files/summer/tutorial.pdf">
    <title>Graph and Network Analysis</title>
    <dc:date>2011-07-25T07:29:24+00:00</dc:date>
    <link>http://mlg.ucd.ie/files/summer/tutorial.pdf</link>
    <dc:creator>mncaudill</dc:creator><dc:subject>Graph network</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mncaudill/b:0dd486a2d740/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:Graph"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:network"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.eecs.harvard.edu/~michaelm/postscripts/kdd2009.pdf">
    <title>On Compressing Social Networks</title>
    <dc:date>2010-12-16T16:28:09+00:00</dc:date>
    <link>http://www.eecs.harvard.edu/~michaelm/postscripts/kdd2009.pdf</link>
    <dc:creator>mncaudill</dc:creator><description><![CDATA["We show that some of the problems are NP-hard yet admit effective heuristics..." 

Effective heuristics are always good.
]]></description>
<dc:subject>scalability architecture graph</dc:subject>
<dc:identifier>https://pinboard.in/u:mncaudill/b:4a5a14445263/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:scalability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:architecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:graph"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>