<?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: Sling Blade Runner</title>
	<atom:link href="http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/feed/" rel="self" type="application/rss+xml" />
	<link>http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/</link>
	<description>Technology and Geek Stuff by Eric Burke</description>
	<lastBuildDate>Mon, 26 Jul 2010 14:36:32 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Matt</title>
		<link>http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/comment-page-1/#comment-27887</link>
		<dc:creator>Matt</dc:creator>
		<pubDate>Wed, 17 Dec 2008 23:33:50 +0000</pubDate>
		<guid isPermaLink="false">http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/#comment-27887</guid>
		<description>I tried to solve this problem as well.  I found a solution with 246 titles and then reviewed my results.  Unfortunately, I missed one.  I should have found 247.  Back to the drawing board.</description>
		<content:encoded><![CDATA[<p>I tried to solve this problem as well.  I found a solution with 246 titles and then reviewed my results.  Unfortunately, I missed one.  I should have found 247.  Back to the drawing board.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gregory Kick</title>
		<link>http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/comment-page-1/#comment-176</link>
		<dc:creator>Gregory Kick</dc:creator>
		<pubDate>Thu, 04 Oct 2007 05:33:51 +0000</pubDate>
		<guid isPermaLink="false">http://stuffthathappens.com/blog/2007/10/03/sling-blade-runner/#comment-176</guid>
		<description>I like little problems like this and your graph solution seems like a good one.  Since there&#039;s been a lot of talk about Patricia tries lately from the with regards to google-collections, that sprang to mind as a possible solution as well.  Given a starting movie, you could find all of the ones that are prefixed by its suffixes in a pretty efficient way.  Plus, it&#039;d have a lean memory footprint because there&#039;d be no overlapping data stored for the strings.  Here&#039;s the javadoc for the limewire&#039;s PatriciaTrie if you&#039;re interested.

http://www.limewire.org/nightly/modules/collection/api/org/limewire/collection/PatriciaTrie.html</description>
		<content:encoded><![CDATA[<p>I like little problems like this and your graph solution seems like a good one.  Since there&#8217;s been a lot of talk about Patricia tries lately from the with regards to google-collections, that sprang to mind as a possible solution as well.  Given a starting movie, you could find all of the ones that are prefixed by its suffixes in a pretty efficient way.  Plus, it&#8217;d have a lean memory footprint because there&#8217;d be no overlapping data stored for the strings.  Here&#8217;s the javadoc for the limewire&#8217;s PatriciaTrie if you&#8217;re interested.</p>
<p><a href="http://www.limewire.org/nightly/modules/collection/api/org/limewire/collection/PatriciaTrie.html" rel="nofollow">http://www.limewire.org/nightly/modules/collection/api/org/limewire/collection/PatriciaTrie.html</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.304 seconds -->
