<?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 (pskomoroch)</title>
    <link>https://pinboard.in/u:pskomoroch/public/</link>
    <description>recent bookmarks from pskomoroch</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/"/>
	<rdf:li rdf:resource="http://mit.edu/6.099/"/>
	<rdf:li rdf:resource="http://www.biomedcentral.com/1471-2105/9/179"/>
	<rdf:li rdf:resource="http://www-users.cs.umn.edu/~banerjee/"/>
	<rdf:li rdf:resource="http://citeseer.ist.psu.edu/cao00scalable.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/">
    <title>MIT OpenCourseWare | Electrical Engineering and Computer Science | 6.055J The Art of Approximation in Science and Engineering, Spring 2008 | Readings</title>
    <dc:date>2012-02-16T10:35:56+00:00</dc:date>
    <link>http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/</link>
    <dc:creator>pskomoroch</dc:creator><dc:subject>streetfighting approximation physics problemsolving</dc:subject>
<dc:identifier>https://pinboard.in/u:pskomoroch/b:cf9f865a430a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:streetfighting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:problemsolving"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mit.edu/6.099/">
    <title>18.098/6.099. Street Fighting Mathematics</title>
    <dc:date>2008-07-14T01:01:31+00:00</dc:date>
    <link>http://mit.edu/6.099/</link>
    <dc:creator>pskomoroch</dc:creator><description><![CDATA[2008 IAPcourse: Art of guessing results and solving problems without doing a proof or an exact calculation.Techniques include extreme-cases reasoning, dimensional analysis, successive approximation, discretization, generalization, and pictorial analysis
]]></description>
<dc:subject>mathematics course slides lectures approximation mit back_of_the_envelope awesome via:chl</dc:subject>
<dc:identifier>https://pinboard.in/u:pskomoroch/b:2122874d98f1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:course"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:slides"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:lectures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:mit"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:back_of_the_envelope"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:awesome"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:via:chl"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.biomedcentral.com/1471-2105/9/179">
    <title>BioMed Central | Full text | Multidimensional scaling for large genomic data sets</title>
    <dc:date>2008-07-10T11:22:47+00:00</dc:date>
    <link>http://www.biomedcentral.com/1471-2105/9/179</link>
    <dc:creator>pskomoroch</dc:creator><description><![CDATA[Our new method reduces the computational complexity from O(N3) to O(N) when the dimension of the feature space is far less than the number of genes N, and it successfully reconstructs the low dimensional representation as does the classical MDS.
]]></description>
<dc:subject>multidimensional_scaling paper approximation large machinelearning</dc:subject>
<dc:identifier>https://pinboard.in/u:pskomoroch/b:f87d3cef7bb4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:multidimensional_scaling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:large"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:machinelearning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-users.cs.umn.edu/~banerjee/">
    <title>Home Page of Arindam Banerjee</title>
    <dc:date>2008-06-28T01:26:37+00:00</dc:date>
    <link>http://www-users.cs.umn.edu/~banerjee/</link>
    <dc:creator>pskomoroch</dc:creator><description><![CDATA[great mmds talk

http://www.stanford.edu/group/mmds/program.html
]]></description>
<dc:subject>people machinelearning collaborative filtering netflixprize mmds bayesian sparse coclustering matrix approximation dirichlet mixture</dc:subject>
<dc:identifier>https://pinboard.in/u:pskomoroch/b:7c3edd8e91f4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:collaborative"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:netflixprize"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:mmds"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:bayesian"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:sparse"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:coclustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:matrix"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:dirichlet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:mixture"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseer.ist.psu.edu/cao00scalable.html">
    <title>A Scalable Method for Estimating Network Traffic Matrices from Link Counts - Cao, Wiel, Yu, Zhu (ResearchIndex)</title>
    <dc:date>2007-06-11T02:49:46+00:00</dc:date>
    <link>http://citeseer.ist.psu.edu/cao00scalable.html</link>
    <dc:creator>pskomoroch</dc:creator><dc:subject>link traffic matrix approximation paper</dc:subject>
<dc:identifier>https://pinboard.in/u:pskomoroch/b:8fdf6f201d62/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:link"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:traffic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:matrix"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:pskomoroch/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>