<?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/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Codelog</title>
	<atom:link href="http://codelog.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://codelog.wordpress.com</link>
	<description>Thou shall code</description>
	<lastBuildDate>Wed, 21 Mar 2007 06:36:26 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on uptosomething.in by ranjhith</title>
		<link>http://codelog.wordpress.com/2007/03/20/uptosomethingin/#comment-2</link>
		<dc:creator>ranjhith</dc:creator>
		<pubDate>Wed, 21 Mar 2007 06:36:26 +0000</pubDate>
		<guid isPermaLink="false">http://codelog.wordpress.com/2007/03/20/uptosomethingin/#comment-2</guid>
		<description>Good that u r Upto Somthing... :) Hoping to see u more!</description>
		<content:encoded><![CDATA[<p>Good that u r Upto Somthing&#8230; <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  Hoping to see u more!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on glossyware by Ankit</title>
		<link>http://codelog.wordpress.com/2007/01/27/glossyware/#comment-1</link>
		<dc:creator>Ankit</dc:creator>
		<pubDate>Fri, 02 Feb 2007 15:39:01 +0000</pubDate>
		<guid isPermaLink="false">http://codelog.wordpress.com/2007/01/27/glossyware/#comment-1</guid>
		<description>This looks cool.

Have you heard of STRMAT? http://www.cs.ucdavis.edu/~gusfield/strmat.html

I stumbled upon it while looking for a way to build some toy application... I can&#039;t remember which right now. Something related to auto-comltete I think, like Google Suggest. 

Anyways, I remembered reading about Suffix trees (or something similar) which will let you create a uber-fast data structure for lookups on vast quantities of text data. 

All in theory of course... I&#039;ve just read a few wikipedia articles on this :)</description>
		<content:encoded><![CDATA[<p>This looks cool.</p>
<p>Have you heard of STRMAT? <a href="http://www.cs.ucdavis.edu/~gusfield/strmat.html" rel="nofollow">http://www.cs.ucdavis.edu/~gusfield/strmat.html</a></p>
<p>I stumbled upon it while looking for a way to build some toy application&#8230; I can&#8217;t remember which right now. Something related to auto-comltete I think, like Google Suggest. </p>
<p>Anyways, I remembered reading about Suffix trees (or something similar) which will let you create a uber-fast data structure for lookups on vast quantities of text data. </p>
<p>All in theory of course&#8230; I&#8217;ve just read a few wikipedia articles on this <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>
