<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / laughingboy / tag / algorithm</title>
<link>http://netvouz.com/laughingboy/tag/algorithm?feed=rss&amp;pg=3</link>
<description>laughingboy&#39;s bookmarks tagged &quot;algorithm&quot; on Netvouz</description>
<item><title>IDisposable: What Your Mother Never Told You About Resource Deallocation.</title>
<link>http://www.codeproject.com/KB/dotnet/idisposable.aspx</link>
<description>another guide to resource deallocation</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sat, 05 Sep 2009 00:33:35 GMT</pubDate>
</item><item><title>IEEE floating point exceptions</title>
<link>http://www.johndcook.com/IEEE_exceptions_in_cpp.html</link>
<description>debugging NaNs, 1.#INF, 1.#IND, etc</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Tue, 03 Aug 2010 19:35:15 GMT</pubDate>
</item><item><title>Implementing the Kelly Criterion</title>
<link>http://r6.ca/blog/20070820T175938Z.html</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Tue, 21 Aug 2007 16:50:00 GMT</pubDate>
</item><item><title>Increasing the Size of your Stack (.NET Memory Management: Part 3)</title>
<link>http://www.atalasoft.com/cs/blogs/rickm/archive/2008/04/22/increasing-the-size-of-your-stack-net-memory-management-part-3.aspx</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Thu, 24 Apr 2008 19:17:23 GMT</pubDate>
</item><item><title>INTRODUCTION TO DIGITAL FILTERS WITH AUDIO APPLICATIONS</title>
<link>http://ccrma.stanford.edu/~jos/filters/</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 18 May 2008 01:54:16 GMT</pubDate>
</item><item><title>Introduction to Machine Learning</title>
<link>http://ai.stanford.edu/people/nilsson/mlbook.html</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 19 Apr 2009 23:27:49 GMT</pubDate>
</item><item><title>Lazy infinite sequences in Clojure and Python @ stack overflow</title>
<link>http://stackoverflow.com/questions/1587412/lazy-infinite-sequences-in-clojure-and-python</link>
<description>good explanations plus wiki link to alternate clojure implementations</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sat, 27 Feb 2010 15:50:28 GMT</pubDate>
</item><item><title>Learning about Machine Learning @ Pin Dancing</title>
<link>http://pindancing.blogspot.com/2010/01/learning-about-machine-learniing.html</link>
<description>books and links for machine learning background</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 17 Jan 2010 15:20:31 GMT</pubDate>
</item><item><title>Learning about Machine Learning, 2nd Ed. @ Measuring Measures</title>
<link>http://measuringmeasures.com/blog/2010/3/12/learning-about-machine-learning-2nd-ed.html</link>
<description>books and articles about machine learning</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Tue, 16 Mar 2010 05:24:57 GMT</pubDate>
</item><item><title>List/Generator Monad Combinators for Python</title>
<link>http://code.activestate.com/recipes/439361/</link>
<description>The List monad in Haskell has many uses, including parsing and nondeterministic algorithms. This code implements the Monad combinators &quot;bind&quot;, &quot;return&quot; and &quot;fail&quot;, and the MonadPlus combinators &quot;plus&quot; and &quot;zero&quot;. It works with all iterables, and returns a generator rather than a list in order to preserve a lazy semantics.</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Wed, 10 Dec 2008 14:49:50 GMT</pubDate>
</item></channel></rss>