<?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 Antimatroid, The</title>
	<atom:link href="http://antimatroid.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://antimatroid.wordpress.com</link>
	<description>niche for the aesthetics, mathematics and computer science</description>
	<lastBuildDate>Thu, 21 May 2009 12:19:59 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on About by Bryant</title>
		<link>http://antimatroid.wordpress.com/about/#comment-54</link>
		<dc:creator>Bryant</dc:creator>
		<pubDate>Thu, 21 May 2009 12:19:59 +0000</pubDate>
		<guid isPermaLink="false">#comment-54</guid>
		<description>I&#039;ve read bits on your blog about radial trees and sunburst diagrams. I really like you sunburst diagram and was considering using it to display an odd data set -- the dynamic capacity of a network, or networked components. maybe not as a monitoring utility, but more along the lines of displaying related capacity growth requirements. And perhaps answer the question : Relatively, how complex is an environment given the &#039;moving parts&#039; of each group. That is .. if I can make the data fit into a coherent tree :)

I have been paging through examples online :
http://www.st.uni-trier.de/~burch/trt/trt.html#introduction

caught my eye.


Regardless in your blog post :
http://antimatroid.wordpress.com/2008/08/31/radial-tree-drawing/
and
http://antimatroid.wordpress.com/2008/08/03/sunburst-an-effective-information-visualization/

I really like the layout. I&#039;d like to tinker with what you have if that would be at all possible. Or, perhaps I can work with you to extend it ?

Let me know. Thanks!</description>
		<content:encoded><![CDATA[<p>I&#8217;ve read bits on your blog about radial trees and sunburst diagrams. I really like you sunburst diagram and was considering using it to display an odd data set &#8212; the dynamic capacity of a network, or networked components. maybe not as a monitoring utility, but more along the lines of displaying related capacity growth requirements. And perhaps answer the question : Relatively, how complex is an environment given the &#8216;moving parts&#8217; of each group. That is .. if I can make the data fit into a coherent tree :)</p>
<p>I have been paging through examples online :<br />
<a href="http://www.st.uni-trier.de/~burch/trt/trt.html#introduction" rel="nofollow">http://www.st.uni-trier.de/~burch/trt/trt.html#introduction</a></p>
<p>caught my eye.</p>
<p>Regardless in your blog post :<br />
<a href="http://antimatroid.wordpress.com/2008/08/31/radial-tree-drawing/" rel="nofollow">http://antimatroid.wordpress.com/2008/08/31/radial-tree-drawing/</a><br />
and<br />
<a href="http://antimatroid.wordpress.com/2008/08/03/sunburst-an-effective-information-visualization/" rel="nofollow">http://antimatroid.wordpress.com/2008/08/03/sunburst-an-effective-information-visualization/</a></p>
<p>I really like the layout. I&#8217;d like to tinker with what you have if that would be at all possible. Or, perhaps I can work with you to extend it ?</p>
<p>Let me know. Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Name that fraction by lewellen</title>
		<link>http://antimatroid.wordpress.com/2008/07/27/name-that-fraction/#comment-15</link>
		<dc:creator>lewellen</dc:creator>
		<pubDate>Mon, 27 Apr 2009 00:21:27 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=214#comment-15</guid>
		<description>Hi Todd, the original comments did not add any value my post so I removed them while doing some spring cleaning- the same spring cleaning that must have triggered an auto-pingback to your site. I Apologize for the auto-pingback. I will be removing the reference to your site shortly. Please feel free to delete the auto-pingback on your site.</description>
		<content:encoded><![CDATA[<p>Hi Todd, the original comments did not add any value my post so I removed them while doing some spring cleaning- the same spring cleaning that must have triggered an auto-pingback to your site. I Apologize for the auto-pingback. I will be removing the reference to your site shortly. Please feel free to delete the auto-pingback on your site.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Name that fraction by Todd Trimble</title>
		<link>http://antimatroid.wordpress.com/2008/07/27/name-that-fraction/#comment-14</link>
		<dc:creator>Todd Trimble</dc:creator>
		<pubDate>Sun, 26 Apr 2009 23:55:23 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=214#comment-14</guid>
		<description>Why were the comments made at the time of the July 2008 posting removed?</description>
		<content:encoded><![CDATA[<p>Why were the comments made at the time of the July 2008 posting removed?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Integer Factorization by Dynamic Programming with Number Theoretic Applications by lewellen</title>
		<link>http://antimatroid.wordpress.com/2009/04/01/integer-factorization-by-dynamic-programming-with-number-theoretic-applications/#comment-12</link>
		<dc:creator>lewellen</dc:creator>
		<pubDate>Wed, 08 Apr 2009 14:04:56 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=615#comment-12</guid>
		<description>I choose to go with a circular diagram because it uses less horizontal space allowing for the entire example problem to be visualized in a compact way.</description>
		<content:encoded><![CDATA[<p>I choose to go with a circular diagram because it uses less horizontal space allowing for the entire example problem to be visualized in a compact way.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Integer Factorization by Dynamic Programming with Number Theoretic Applications by Chris Dew</title>
		<link>http://antimatroid.wordpress.com/2009/04/01/integer-factorization-by-dynamic-programming-with-number-theoretic-applications/#comment-11</link>
		<dc:creator>Chris Dew</dc:creator>
		<pubDate>Wed, 08 Apr 2009 08:14:30 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=615#comment-11</guid>
		<description>Thanks for an interesting article.

Could you let me know why the diagram is circular?  

I could understand this if the algorithm was dealing with finite fields/modular arithmetic, but I can&#039;t see why the diagram wouldn&#039;t be clearer horizontally.</description>
		<content:encoded><![CDATA[<p>Thanks for an interesting article.</p>
<p>Could you let me know why the diagram is circular?  </p>
<p>I could understand this if the algorithm was dealing with finite fields/modular arithmetic, but I can&#8217;t see why the diagram wouldn&#8217;t be clearer horizontally.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Integer Factorization by Dynamic Programming with Number Theoretic Applications by lewellen</title>
		<link>http://antimatroid.wordpress.com/2009/04/01/integer-factorization-by-dynamic-programming-with-number-theoretic-applications/#comment-10</link>
		<dc:creator>lewellen</dc:creator>
		<pubDate>Wed, 08 Apr 2009 00:35:35 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=615#comment-10</guid>
		<description>Thanks for pointing this out. Switched == to be != in Euler Totient and Dedekind Psi function.</description>
		<content:encoded><![CDATA[<p>Thanks for pointing this out. Switched == to be != in Euler Totient and Dedekind Psi function.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Integer Factorization by Dynamic Programming with Number Theoretic Applications by Mikael</title>
		<link>http://antimatroid.wordpress.com/2009/04/01/integer-factorization-by-dynamic-programming-with-number-theoretic-applications/#comment-9</link>
		<dc:creator>Mikael</dc:creator>
		<pubDate>Tue, 07 Apr 2009 12:36:34 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=615#comment-9</guid>
		<description>Hi! Thank you for this nice algorithm! The branches of your totient function are reversed though!</description>
		<content:encoded><![CDATA[<p>Hi! Thank you for this nice algorithm! The branches of your totient function are reversed though!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Integer Factorization by Dynamic Programming with Number Theoretic Applications by chethan</title>
		<link>http://antimatroid.wordpress.com/2009/04/01/integer-factorization-by-dynamic-programming-with-number-theoretic-applications/#comment-8</link>
		<dc:creator>chethan</dc:creator>
		<pubDate>Tue, 07 Apr 2009 09:51:28 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=615#comment-8</guid>
		<description>good Method.
Excellent</description>
		<content:encoded><![CDATA[<p>good Method.<br />
Excellent</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Sunburst: an effective Information Visualization by Taras Brizitsky</title>
		<link>http://antimatroid.wordpress.com/2008/08/03/sunburst-an-effective-information-visualization/#comment-7</link>
		<dc:creator>Taras Brizitsky</dc:creator>
		<pubDate>Mon, 16 Mar 2009 10:28:20 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=202#comment-7</guid>
		<description>Sunburst/Treepie visuzlization is used in our hard disk visuzlization application, DaisyDisk. While the task is quite specific we&#039;ve improved the original concept a bit and made navigation easier.</description>
		<content:encoded><![CDATA[<p>Sunburst/Treepie visuzlization is used in our hard disk visuzlization application, DaisyDisk. While the task is quite specific we&#8217;ve improved the original concept a bit and made navigation easier.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Solutions to some Microsoft interview questions by Recent Faves Tagged With "sourcecode" : MyNetFaves</title>
		<link>http://antimatroid.wordpress.com/2008/08/24/microsoft-interview-questions/#comment-5</link>
		<dc:creator>Recent Faves Tagged With "sourcecode" : MyNetFaves</dc:creator>
		<pubDate>Mon, 22 Sep 2008 17:50:19 +0000</pubDate>
		<guid isPermaLink="false">http://antimatroid.wordpress.com/?p=68#comment-5</guid>
		<description>[...] &gt;&gt; sourcecode    My Top 10 Source Code Search Engines First saved by mmbuzon &#124; 1 days ago      Microsoft Interview Questions First saved by joshuailug &#124; 2 days [...]</description>
		<content:encoded><![CDATA[<p>[...] &gt;&gt; sourcecode    My Top 10 Source Code Search Engines First saved by mmbuzon | 1 days ago      Microsoft Interview Questions First saved by joshuailug | 2 days [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
