<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Optimize Your Code: Matrix Multiplication</title><link>http://blogs.msdn.com/xiangfan/archive/2009/04/28/optimize-your-code-matrix-multiplication.aspx</link><description>Matrix multiplication is common and the algorithm is easy to implementation. Here is one example: Version 1: template &amp;lt; typename T&amp;gt; void SeqMatrixMult1( int size, T** m1, T** m2, T** result) { for ( int i = 0; i &amp;lt; size; i++) { for ( int j = 0;</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Optimize Your Code: Matrix Multiplication | Microsoft Share Point</title><link>http://blogs.msdn.com/xiangfan/archive/2009/04/28/optimize-your-code-matrix-multiplication.aspx#9573562</link><pubDate>Tue, 28 Apr 2009 16:33:02 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9573562</guid><dc:creator>Optimize Your Code: Matrix Multiplication | Microsoft Share Point</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://microsoft-sharepoint.simplynetdev.com/optimize-your-code-matrix-multiplication/"&gt;http://microsoft-sharepoint.simplynetdev.com/optimize-your-code-matrix-multiplication/&lt;/a&gt;&lt;/p&gt;
</description></item></channel></rss>