<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: A simple plea to all computer scientists</title>
	<atom:link href="http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html/feed" rel="self" type="application/rss+xml" />
	<link>http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html</link>
	<description>There exist problems, intractable to decide, yet easy to check.</description>
	<lastBuildDate>Fri, 07 May 2010 22:25:51 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Kurt</title>
		<link>http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html/comment-page-1#comment-63</link>
		<dc:creator>Kurt</dc:creator>
		<pubDate>Fri, 17 Aug 2007 14:55:31 +0000</pubDate>
		<guid isPermaLink="false">http://learningcomputation.wordpress.com/2007/07/25/a-simple-plea-to-all-computer-scientists#comment-63</guid>
		<description>Laura,Thanks for the comment.  Your citation influence work looks very interesting (from the point of view of a potential user of the system).  I haven&#039;t had a chance to download the viewer software yet, but I&#039;ll be sure to do that when I have time.  I hope you have success with the open source development, because it would be great to have this publicly available with a web-based front end on it.Of course, once the important pieces of research are identified, it would still be nice to have a lower price-point for purchasing articles...-Kurt</description>
		<content:encoded><![CDATA[<p>Laura,Thanks for the comment.  Your citation influence work looks very interesting (from the point of view of a potential user of the system).  I haven&#8217;t had a chance to download the viewer software yet, but I&#8217;ll be sure to do that when I have time.  I hope you have success with the open source development, because it would be great to have this publicly available with a web-based front end on it.Of course, once the important pieces of research are identified, it would still be nice to have a lower price-point for purchasing articles&#8230;-Kurt</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Laura Dietz</title>
		<link>http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html/comment-page-1#comment-64</link>
		<dc:creator>Laura Dietz</dc:creator>
		<pubDate>Thu, 16 Aug 2007 14:21:37 +0000</pubDate>
		<guid isPermaLink="false">http://learningcomputation.wordpress.com/2007/07/25/a-simple-plea-to-all-computer-scientists#comment-64</guid>
		<description>Kurt,I definitely agree with you that $30 is too much when you are not 100% sure the paper is of great value.I also see the point that there are publishers that need to make money. And AFAIK their terms do not permit the authors to put their PDFs online (although many researchers do it illegally).Of course we all hope that soon all publications are accessible for free. Until then I propose a different approach consisting of two ingredients.At ICML07 I published a paper about &quot;Unsupervised Prediction of Citation Influences&quot; (you can also try out the prototype here: http://www.mpi-inf.mpg.de/~dietz/citinf.html ). Given some seed publications it depicts the citation graph of papers that are strongly related, filtering out many citations / citings that are not really relevant. The second ingredient is that publishers (i.e. Nature) are thinking about the OTMI interface. This is an interface that basically  gives access to the word histogram of the papers, which is fine for many machine learning methods (such as the Citation Influence Model), but does not reveal the human readable version, with which they earn money.Cheers,-- Laura</description>
		<content:encoded><![CDATA[<p>Kurt,I definitely agree with you that $30 is too much when you are not 100% sure the paper is of great value.I also see the point that there are publishers that need to make money. And AFAIK their terms do not permit the authors to put their PDFs online (although many researchers do it illegally).Of course we all hope that soon all publications are accessible for free. Until then I propose a different approach consisting of two ingredients.At ICML07 I published a paper about &#8220;Unsupervised Prediction of Citation Influences&#8221; (you can also try out the prototype here: <a href="http://www.mpi-inf.mpg.de/~dietz/citinf.html" rel="nofollow">http://www.mpi-inf.mpg.de/~dietz/citinf.html</a> ). Given some seed publications it depicts the citation graph of papers that are strongly related, filtering out many citations / citings that are not really relevant. The second ingredient is that publishers (i.e. Nature) are thinking about the OTMI interface. This is an interface that basically  gives access to the word histogram of the papers, which is fine for many machine learning methods (such as the Citation Influence Model), but does not reveal the human readable version, with which they earn money.Cheers,&#8211; Laura</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kurt</title>
		<link>http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html/comment-page-1#comment-65</link>
		<dc:creator>Kurt</dc:creator>
		<pubDate>Thu, 26 Jul 2007 02:46:56 +0000</pubDate>
		<guid isPermaLink="false">http://learningcomputation.wordpress.com/2007/07/25/a-simple-plea-to-all-computer-scientists#comment-65</guid>
		<description>Thanks for the pointer.  I actually had a link to Papadimitriou&#039;s Reading the Classics course in an old blog entry, but I didn&#039;t think to check there.The funny thing about my search for the Karp paper was that I was over-specifying.  By entering the full title, I was getting page after page of hits from other papers&#039; citation lists.  On his web page, Papadimitriou simply referred to it as &quot;Karp&#039;s 1972 paper&quot;, and sure enough if I do a Google search on &quot;karp paper 1972&quot;, it shows up half-way down the first page of results.</description>
		<content:encoded><![CDATA[<p>Thanks for the pointer.  I actually had a link to Papadimitriou&#8217;s Reading the Classics course in an old blog entry, but I didn&#8217;t think to check there.The funny thing about my search for the Karp paper was that I was over-specifying.  By entering the full title, I was getting page after page of hits from other papers&#8217; citation lists.  On his web page, Papadimitriou simply referred to it as &#8220;Karp&#8217;s 1972 paper&#8221;, and sure enough if I do a Google search on &#8220;karp paper 1972&#8243;, it shows up half-way down the first page of results.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 知北遊</title>
		<link>http://learningcomputation.com/blog/2007/07/simple-plea-to-all-computer-scientists.html/comment-page-1#comment-66</link>
		<dc:creator>知北遊</dc:creator>
		<pubDate>Wed, 25 Jul 2007 10:28:42 +0000</pubDate>
		<guid isPermaLink="false">http://learningcomputation.wordpress.com/2007/07/25/a-simple-plea-to-all-computer-scientists#comment-66</guid>
		<description>Christos H. Papadimitriou had given a course called ``CS294:  Reading the Classics&#039;&#039;.http://www.cs.berkeley.edu/~christos/classics/cs298.htmlThere are e-prints of some classic papers, including ``Reducibility among combinatorial problems.&#039;&#039;I have a part-time job in university library. My job is about Document Delivery Service. Some great papers are requested copies very often, but, for academic publisher, it might be not worthy to scan old papers published decades ago.Besides, the frequent scanning or copying is really hurtful to the paper-print. I am convinced that digitalizing those classic papers is good for academia.</description>
		<content:encoded><![CDATA[<p>Christos H. Papadimitriou had given a course called &#8220;CS294:  Reading the Classics&#8221;.http://www.cs.berkeley.edu/~christos/classics/cs298.htmlThere are e-prints of some classic papers, including &#8220;Reducibility among combinatorial problems.&#8221;I have a part-time job in university library. My job is about Document Delivery Service. Some great papers are requested copies very often, but, for academic publisher, it might be not worthy to scan old papers published decades ago.Besides, the frequent scanning or copying is really hurtful to the paper-print. I am convinced that digitalizing those classic papers is good for academia.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

