<?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"
	>
<channel>
	<title>Comments for Paper of the Week</title>
	<atom:link href="http://www.paperoftheweek.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.paperoftheweek.com</link>
	<description>Read. Learn. Discuss.</description>
	<pubDate>Fri, 25 Jul 2008 15:51:59 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>Comment on Google&#8217;s initiatives in Artificial Intelligence by Ian Parker</title>
		<link>http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2378</link>
		<dc:creator>Ian Parker</dc:creator>
		<pubDate>Mon, 18 Jun 2007 15:05:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2378</guid>
		<description>If you do a search on N engines, you need a criterion to decide which set of results are the best. I am prepared to admit that other search engines are better in specialist spheres. This being so you could, I suppose, decide in what area you wanted to search and provide the appropriate engine four you.

In fact Google already does have specialist areas. The selection of a specialist area should really be transparent to the user.

As I said Google, unlike Windows is not bungled. The fact that Google is constantlt increasing its share seems to point to the fact that it is perceived to be the best for the general search.</description>
		<content:encoded><![CDATA[<p>If you do a search on N engines, you need a criterion to decide which set of results are the best. I am prepared to admit that other search engines are better in specialist spheres. This being so you could, I suppose, decide in what area you wanted to search and provide the appropriate engine four you.</p>
<p>In fact Google already does have specialist areas. The selection of a specialist area should really be transparent to the user.</p>
<p>As I said Google, unlike Windows is not bungled. The fact that Google is constantlt increasing its share seems to point to the fact that it is perceived to be the best for the general search.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Google&#8217;s initiatives in Artificial Intelligence by Charles Knight</title>
		<link>http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2358</link>
		<dc:creator>Charles Knight</dc:creator>
		<pubDate>Sun, 17 Jun 2007 17:42:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2358</guid>
		<description>Sorry!  Please make that www.altsearchengines.com  Thanks!</description>
		<content:encoded><![CDATA[<p>Sorry!  Please make that <a href="http://www.altsearchengines.com" rel="nofollow">http://www.altsearchengines.com</a>  Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Google&#8217;s initiatives in Artificial Intelligence by Charles Knight</title>
		<link>http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2357</link>
		<dc:creator>Charles Knight</dc:creator>
		<pubDate>Sun, 17 Jun 2007 17:41:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/06/17/googles-initiatives-in-artificial-intelligence/#comment-2357</guid>
		<description>Hi - My name is Charles Knight, the author of the Top 100 Alternative Search Engines list. Just a note that your link is to the oldest list (January)  www.ReadWriteWeb.com has the more recent months and commentary, and the popularity has been such that now there is a new R/WW blog "AltSearchEngines" ww.altsearchengines.com.

There may not be any one (1) alt search engine (ASE) that can challenge Google, but what about our Top Ten (10), what about the Top one hundred (100) list?; what about the Master list we maintain of the Top one thousand (1,000) - could 1,000 ASE muster the creativity and resources necessary to draw some interest away from the major search engines?

Charles Knight, Editor
Charles@ReadWriteWeb
ww.AltSearchEngines.com</description>
		<content:encoded><![CDATA[<p>Hi - My name is Charles Knight, the author of the Top 100 Alternative Search Engines list. Just a note that your link is to the oldest list (January)  <a href="http://www.ReadWriteWeb.com" rel="nofollow">http://www.ReadWriteWeb.com</a> has the more recent months and commentary, and the popularity has been such that now there is a new R/WW blog &#8220;AltSearchEngines&#8221; ww.altsearchengines.com.</p>
<p>There may not be any one (1) alt search engine (ASE) that can challenge Google, but what about our Top Ten (10), what about the Top one hundred (100) list?; what about the Master list we maintain of the Top one thousand (1,000) - could 1,000 ASE muster the creativity and resources necessary to draw some interest away from the major search engines?</p>
<p>Charles Knight, Editor<br />
Charles@ReadWriteWeb<br />
ww.AltSearchEngines.com</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on TextRank by Rada Mihalcea and Paul Tarau by John</title>
		<link>http://www.paperoftheweek.com/2007/01/29/textrank-by-rada-mihalcea-and-paul-tarau/#comment-2159</link>
		<dc:creator>John</dc:creator>
		<pubDate>Mon, 04 Jun 2007 09:14:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/29/textrank-by-rada-mihalcea-and-paul-tarau/#comment-2159</guid>
		<description>This is very facinating but a bit over my head. DO you have any ideas or site links I could get started on the basics.</description>
		<content:encoded><![CDATA[<p>This is very facinating but a bit over my head. DO you have any ideas or site links I could get started on the basics.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Discussion of Section 3 of TextRank by Adriano</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-957</link>
		<dc:creator>Adriano</dc:creator>
		<pubDate>Fri, 27 Apr 2007 12:56:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-957</guid>
		<description>Thanks for the link. I wanted to ask if the algorithm TextRank can be implemented in Javascript for one extension of firefox?</description>
		<content:encoded><![CDATA[<p>Thanks for the link. I wanted to ask if the algorithm TextRank can be implemented in Javascript for one extension of firefox?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Discussion of Section 3 of TextRank by grant.ingersoll</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-956</link>
		<dc:creator>grant.ingersoll</dc:creator>
		<pubDate>Fri, 27 Apr 2007 12:17:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-956</guid>
		<description>I have some pseudocode at http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/</description>
		<content:encoded><![CDATA[<p>I have some pseudocode at <a href="http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/" rel="nofollow">http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Discussion of Section 3 of TextRank by Adriano</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-955</link>
		<dc:creator>Adriano</dc:creator>
		<pubDate>Fri, 27 Apr 2007 09:48:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-955</guid>
		<description>I'm a graduate student and is working on a Web Page Recommender System learning, based on user's bookmark file. I'm interested in TextRank for Keyword Extraction and would highly appreciate if you could help me regarding where may find algorithm's pseudocode. Actually, I have studied this paper: "TextRank: Bringing Order into Texts. In Proc. of EMNLP 2004, Barcelona, Spain, July 2004.". Thanks for answer.</description>
		<content:encoded><![CDATA[<p>I&#8217;m a graduate student and is working on a Web Page Recommender System learning, based on user&#8217;s bookmark file. I&#8217;m interested in TextRank for Keyword Extraction and would highly appreciate if you could help me regarding where may find algorithm&#8217;s pseudocode. Actually, I have studied this paper: &#8220;TextRank: Bringing Order into Texts. In Proc. of EMNLP 2004, Barcelona, Spain, July 2004.&#8221;. Thanks for answer.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Guest Contributor: Ian Parker by Otis Gospodnetic</title>
		<link>http://www.paperoftheweek.com/2007/04/18/guest-contributor-ian-parker/#comment-847</link>
		<dc:creator>Otis Gospodnetic</dc:creator>
		<pubDate>Fri, 20 Apr 2007 16:33:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/04/18/guest-contributor-ian-parker/#comment-847</guid>
		<description>Woho, I'm looking forward to seeing/reading this stuff.</description>
		<content:encoded><![CDATA[<p>Woho, I&#8217;m looking forward to seeing/reading this stuff.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Guest Contributor wanted for next 3 weeks by Ian Parker</title>
		<link>http://www.paperoftheweek.com/2007/04/15/guest-contributor-wanted-for-next-3-weeks/#comment-771</link>
		<dc:creator>Ian Parker</dc:creator>
		<pubDate>Mon, 16 Apr 2007 11:17:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/04/15/guest-contributor-wanted-for-next-3-weeks/#comment-771</guid>
		<description>http://ipai.blogspot.com
http://ipai2.blogspot.com

Are also blogs on AI.

You will tell me what sort of article and what sort of level is required. I feel I must warn you that my views are controversial.

I think a good title might be :-

"A second laguage - An alternative to Turing?"</description>
		<content:encoded><![CDATA[<p><a href="http://ipai.blogspot.com" rel="nofollow">http://ipai.blogspot.com</a><br />
<a href="http://ipai2.blogspot.com" rel="nofollow">http://ipai2.blogspot.com</a></p>
<p>Are also blogs on AI.</p>
<p>You will tell me what sort of article and what sort of level is required. I feel I must warn you that my views are controversial.</p>
<p>I think a good title might be :-</p>
<p>&#8220;A second laguage - An alternative to Turing?&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on POTW 3/26/07: &#8220;Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition&#8221; by Osinski, Stefanowski, and Weiss by Stanislaw Osinski</title>
		<link>http://www.paperoftheweek.com/2007/04/06/potw-32607-lingo-search-results-clustering-algorithm-based-on-singular-value-decomposition-by-osinski-stefanowski-and-weiss-3/#comment-554</link>
		<dc:creator>Stanislaw Osinski</dc:creator>
		<pubDate>Sun, 08 Apr 2007 20:58:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/04/06/potw-32607-lingo-search-results-clustering-algorithm-based-on-singular-value-decomposition-by-osinski-stefanowski-and-weiss-3/#comment-554</guid>
		<description>A few more recent papers on Lingo and other search results clustering papers you can find on the home page of the Carrot2 Search Results Clustering Engine:

http://project.carrot2.org/publications.html</description>
		<content:encoded><![CDATA[<p>A few more recent papers on Lingo and other search results clustering papers you can find on the home page of the Carrot2 Search Results Clustering Engine:</p>
<p><a href="http://project.carrot2.org/publications.html" rel="nofollow">http://project.carrot2.org/publications.html</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
