<?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: MIT Puzzle Research</title>
	<atom:link href="http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/feed/" rel="self" type="application/rss+xml" />
	<link>http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/</link>
	<description>Benji Smith, Software Research</description>
	<lastBuildDate>Fri, 05 Feb 2010 01:17:14 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Brian Vandenberg</title>
		<link>http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/comment-page-1/#comment-44838</link>
		<dc:creator>Brian Vandenberg</dc:creator>
		<pubDate>Thu, 21 Jun 2007 19:09:55 +0000</pubDate>
		<guid isPermaLink="false">http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/#comment-44838</guid>
		<description>Hey Benji, long time :)

  Not quite in the realm of search-spaces &amp; NP-complete problems, but here&#039;s an interesting CS research link you may find interesting:

http://www.dspguide.com/

  The thrust of it is showing how to use various analysis techniques on signals and images.  The book is free (unless you want a hardcopy), and each chapter can be downloaded if it interests you.  Chapters ~2-5 are rather dry (#1 is an intro), but they&#039;re readable if you want a refresher on stats and other mathy stuff used in the book.  The stuff I found most interesting starts around chapter 24, and the chapters before it that introduce material used in 24.  They start to show how the convolution and fourier analysis can be used to compare two similar images to see how closely their major features resemble eachother.

  Later on in the book they also start to go into how the Z-transform (the discrete version of the laplace transform) can be used in signal analysis as well.  There&#039;s also a chapter on neural networks (yay!).

  Anyway, you should hop on IM sometime and tell me how things are going in Boston :)</description>
		<content:encoded><![CDATA[<p>Hey Benji, long time :)</p>
<p>  Not quite in the realm of search-spaces &amp; NP-complete problems, but here&#8217;s an interesting CS research link you may find interesting:</p>
<p><a href="http://www.dspguide.com/" rel="nofollow">http://www.dspguide.com/</a></p>
<p>  The thrust of it is showing how to use various analysis techniques on signals and images.  The book is free (unless you want a hardcopy), and each chapter can be downloaded if it interests you.  Chapters ~2-5 are rather dry (#1 is an intro), but they&#8217;re readable if you want a refresher on stats and other mathy stuff used in the book.  The stuff I found most interesting starts around chapter 24, and the chapters before it that introduce material used in 24.  They start to show how the convolution and fourier analysis can be used to compare two similar images to see how closely their major features resemble eachother.</p>
<p>  Later on in the book they also start to go into how the Z-transform (the discrete version of the laplace transform) can be used in signal analysis as well.  There&#8217;s also a chapter on neural networks (yay!).</p>
<p>  Anyway, you should hop on IM sometime and tell me how things are going in Boston :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Moyer</title>
		<link>http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/comment-page-1/#comment-41136</link>
		<dc:creator>Steve Moyer</dc:creator>
		<pubDate>Wed, 06 Jun 2007 18:24:37 +0000</pubDate>
		<guid isPermaLink="false">http://benjismith.net/index.php/2007/06/04/mit-puzzle-research/#comment-41136</guid>
		<description>Thanks for the excellent link ... you should come join the discussion at http://games.groups.yahoo.com/group/eternity_two/.</description>
		<content:encoded><![CDATA[<p>Thanks for the excellent link &#8230; you should come join the discussion at <a href="http://games.groups.yahoo.com/group/eternity_two/." rel="nofollow">http://games.groups.yahoo.com/group/eternity_two/.</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
