<?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>Reservoir Sampling</title><link>http://blogs.msdn.com/spt/archive/2008/02/05/reservoir-sampling.aspx</link><description>A simple random sampling strategy to produce a sample without replacement from a stream of data - that is, in one pass: O(N) Want to sample s instances - uniformly at random without replacement - from a population size of n records, where n is not known.</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>MSDN Blog Postings  &amp;raquo; Reservoir Sampling</title><link>http://blogs.msdn.com/spt/archive/2008/02/05/reservoir-sampling.aspx#7462080</link><pubDate>Tue, 05 Feb 2008 13:35:02 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:7462080</guid><dc:creator>MSDN Blog Postings  » Reservoir Sampling</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://msdnrss.thecoderblogs.com/2008/02/05/reservoir-sampling/"&gt;http://msdnrss.thecoderblogs.com/2008/02/05/reservoir-sampling/&lt;/a&gt;&lt;/p&gt;
</description></item><item><title>More Powerful Aggregations in PLINQ</title><link>http://blogs.msdn.com/spt/archive/2008/02/05/reservoir-sampling.aspx#8576241</link><pubDate>Thu, 05 Jun 2008 23:45:51 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:8576241</guid><dc:creator>Parallel Programming with .NET</dc:creator><description>&lt;p&gt;In the June 2008 CTP, PLINQ aggregations are more powerful than they were in the December 2007 CTP. The&lt;/p&gt;
</description></item></channel></rss>