<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Redcode &#187; Algorithms</title>
	<atom:link href="http://www.redcode.nl/blog/category/algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.redcode.nl</link>
	<description>Random</description>
	<lastBuildDate>Sun, 06 Jun 2010 18:37:15 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Creating Shazam in Java</title>
		<link>http://www.redcode.nl/blog/2010/06/creating-shazam-in-java/</link>
		<comments>http://www.redcode.nl/blog/2010/06/creating-shazam-in-java/#comments</comments>
		<pubDate>Tue, 01 Jun 2010 00:43:08 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java Programming]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[music matching]]></category>
		<category><![CDATA[shazam]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=391</guid>
		<description><![CDATA[A couple of days ago I encountered this article: How Shazam Works This got me interested in how a program like Shazam works&#8230; And more importantly, how hard is it to program something similar in Java? About Shazam Shazam is an application which you can use to analyse/match music. When you install it on your [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2010/06/creating-shazam-in-java/feed/</wfw:commentRss>
		<slash:comments>39</slash:comments>
		</item>
		<item>
		<title>Compression by prediction</title>
		<link>http://www.redcode.nl/blog/2010/02/compression-by-prediction/</link>
		<comments>http://www.redcode.nl/blog/2010/02/compression-by-prediction/#comments</comments>
		<pubDate>Wed, 17 Feb 2010 09:39:23 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[arithmetic coding]]></category>
		<category><![CDATA[compression]]></category>
		<category><![CDATA[ppm]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=362</guid>
		<description><![CDATA[The last couple of weeks I have been playing around with compression/decompression algorithms. This is a field that has always intrigued me. It gives me a magical feeling, like a magician you wave some algorithm around and suddenly the files shrink and bytes dissapear. With the same motion you can undo all your actions and [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2010/02/compression-by-prediction/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Placement of circle over points</title>
		<link>http://www.redcode.nl/blog/2010/01/placement-of-circle-over-points/</link>
		<comments>http://www.redcode.nl/blog/2010/01/placement-of-circle-over-points/#comments</comments>
		<pubDate>Wed, 27 Jan 2010 14:02:57 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java Programming]]></category>
		<category><![CDATA[bron-kerbosch]]></category>
		<category><![CDATA[geometry]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=323</guid>
		<description><![CDATA[For the Queue ICPC programming game Capture I ran into a geometrical problem. While programming my little robot I wanted to have an algorithm calculate this for me: I have a field with 122 points I have a circle of fixed size How do I calculate where to put the circle so it encapsulates the [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2010/01/placement-of-circle-over-points/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Guess the algorithm</title>
		<link>http://www.redcode.nl/blog/2010/01/guess-the-algorithm/</link>
		<comments>http://www.redcode.nl/blog/2010/01/guess-the-algorithm/#comments</comments>
		<pubDate>Sat, 23 Jan 2010 20:54:24 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java Programming]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[guess]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=308</guid>
		<description><![CDATA[Yesterday I found and programmed a nice little algorithm. I&#8217;m not going to tell you (yet) what it does and how its called, but I&#8217;ll just show the code: private int function(int x, int y) { int r = 0; while(x!=0) { if((x&#038;1)==1) { r+=y; } x&#62;&#62;&#62;=1; y&#60;&#60;=1; } return r; } So tell me, [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2010/01/guess-the-algorithm/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>MD5 quine, fixed point</title>
		<link>http://www.redcode.nl/blog/2010/01/md5-fixed-point/</link>
		<comments>http://www.redcode.nl/blog/2010/01/md5-fixed-point/#comments</comments>
		<pubDate>Tue, 05 Jan 2010 15:04:53 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Math]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=217</guid>
		<description><![CDATA[MD5 quines Sometimes I let my mind wonder and I get crazy questions. Today was a good example, I encountered a MD5 hash and I started to wonder, would there be a hash which would (when hashed again) be the same? Thus: MD5(x) = x This would be a kind of MD5 quine, when fed [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2010/01/md5-fixed-point/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Eureqa</title>
		<link>http://www.redcode.nl/blog/2009/12/eureqa/</link>
		<comments>http://www.redcode.nl/blog/2009/12/eureqa/#comments</comments>
		<pubDate>Fri, 04 Dec 2009 20:14:48 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[cornell]]></category>
		<category><![CDATA[eureqa]]></category>
		<category><![CDATA[genetic programming]]></category>
		<category><![CDATA[symbolic regression]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=66</guid>
		<description><![CDATA[I&#8217;ve just stumbled across a new program: Eureqa Its a program, developed by the Cornell Computational Synthesis Laboratory, that can detect equations in sets of data. Its primary goal is to identify the simplest mathematical formulas which could describe the underlying mechanisms that produced the data. Its best described using their instructional video: I&#8217;ve been [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2009/12/eureqa/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Son Of Darts</title>
		<link>http://www.redcode.nl/blog/2009/12/son-of-darts/</link>
		<comments>http://www.redcode.nl/blog/2009/12/son-of-darts/#comments</comments>
		<pubDate>Fri, 04 Dec 2009 15:17:16 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[azspcs]]></category>
		<category><![CDATA[postage stamp]]></category>
		<category><![CDATA[zimmermann]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=42</guid>
		<description><![CDATA[Another thing I&#8217;ve been very busy with lately is AZsPCs (Al Zimmermanns Programming Competition). The current contest is called Son of Darts. The idea behind these contests are that they are easy to grasp, but very hard to master. Lets take three darts. You have to throw them to a dartboard which is divided into [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2009/12/son-of-darts/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Quine &#8211; McCluskey</title>
		<link>http://www.redcode.nl/blog/2009/12/quine-mccluskey/</link>
		<comments>http://www.redcode.nl/blog/2009/12/quine-mccluskey/#comments</comments>
		<pubDate>Fri, 04 Dec 2009 14:55:20 +0000</pubDate>
		<dc:creator>royvanrijn</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Boolean logic]]></category>
		<category><![CDATA[Quine]]></category>

		<guid isPermaLink="false">http://www.redcode.nl/?p=33</guid>
		<description><![CDATA[About a week ago I had a discussion with a fellow programmer about some boolean logic. We had three parameters, something like: personHasInsurence (A) personNeedsInsurence (B) personIsKnownAtThisAgency (C) We also had two particulair cases for an insurance page: Case 1: Person has insurence and isn&#8217;t yet known at this agency Case 2: Person doesn&#8217;t have [...]]]></description>
		<wfw:commentRss>http://www.redcode.nl/blog/2009/12/quine-mccluskey/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
