<?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: Time and distance</title>
	<atom:link href="http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/feed/" rel="self" type="application/rss+xml" />
	<link>http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/</link>
	<description>Droplets of Yes and No</description>
	<lastBuildDate>Fri, 31 Dec 2010 05:48:28 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Possibility And Probability &#187; Random Thoughts</title>
		<link>http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/comment-page-1/#comment-1672</link>
		<dc:creator>Possibility And Probability &#187; Random Thoughts</dc:creator>
		<pubDate>Sat, 22 Apr 2006 14:50:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.ironboundsoftware.com/blog/?p=203#comment-1672</guid>
		<description>[...] I recently put up my 200th post. I didn&#8217;t realize that until the other day while I was looking at something else. I think that&#8217;s kinda neat, because when I started this whole blogging thing, I thought it was a little bit goofy, kinda like Doogie Howser writing in his computer journal. (Was Doogie the first blogger???) Anyways, I&#8217;m impressed that I&#8217;ve been able to come up with 200 things to write about over the last two years or so. [...]</description>
		<content:encoded><![CDATA[<p>[...] I recently put up my 200th post. I didn&#8217;t realize that until the other day while I was looking at something else. I think that&#8217;s kinda neat, because when I started this whole blogging thing, I thought it was a little bit goofy, kinda like Doogie Howser writing in his computer journal. (Was Doogie the first blogger???) Anyways, I&#8217;m impressed that I&#8217;ve been able to come up with 200 things to write about over the last two years or so. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jerry chen</title>
		<link>http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/comment-page-1/#comment-1671</link>
		<dc:creator>jerry chen</dc:creator>
		<pubDate>Sat, 08 Apr 2006 06:16:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.ironboundsoftware.com/blog/?p=203#comment-1671</guid>
		<description>good&#039;ol steepest descent, in plain english!

have you heard of the method of Conjugate Gradient Descent? a friend introduced me to this. i found the article easy to grasp and fairly enlightening.

http://cauchy.math.colostate.edu/Resources/SD_CG/index.html</description>
		<content:encoded><![CDATA[<p>good&#8217;ol steepest descent, in plain english!</p>
<p>have you heard of the method of Conjugate Gradient Descent? a friend introduced me to this. i found the article easy to grasp and fairly enlightening.</p>
<p><a href="http://cauchy.math.colostate.edu/Resources/SD_CG/index.html" rel="nofollow">http://cauchy.math.colostate.edu/Resources/SD_CG/index.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nick</title>
		<link>http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/comment-page-1/#comment-1670</link>
		<dc:creator>Nick</dc:creator>
		<pubDate>Tue, 04 Apr 2006 12:43:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.ironboundsoftware.com/blog/?p=203#comment-1670</guid>
		<description>The other day I was looking at a book and there was some talk of matrices in there, I&#039;ll have to go see if I can find it.</description>
		<content:encoded><![CDATA[<p>The other day I was looking at a book and there was some talk of matrices in there, I&#8217;ll have to go see if I can find it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jerry chen</title>
		<link>http://ironboundsoftware.com/blog/2006/04/01/time-and-distance/comment-page-1/#comment-1669</link>
		<dc:creator>jerry chen</dc:creator>
		<pubDate>Mon, 03 Apr 2006 18:23:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.ironboundsoftware.com/blog/?p=203#comment-1669</guid>
		<description>this is very interesting. these guys want to use Group Theory to solve Matrix Multiplication at complexity approaching O(n^2).. i don&#039;t believe it. but yet i hope they succeed. have you any algorithm that is fast in doing matrix inversion?

Toward an Optimal Algorithm for Matrix Multiplication

http://www.siam.org/pdf/news/174.pdf</description>
		<content:encoded><![CDATA[<p>this is very interesting. these guys want to use Group Theory to solve Matrix Multiplication at complexity approaching O(n^2).. i don&#8217;t believe it. but yet i hope they succeed. have you any algorithm that is fast in doing matrix inversion?</p>
<p>Toward an Optimal Algorithm for Matrix Multiplication</p>
<p><a href="http://www.siam.org/pdf/news/174.pdf" rel="nofollow">http://www.siam.org/pdf/news/174.pdf</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

