By dotCore
via blog.notdot.net
Published: Aug 29 2012 / 08:39
In the last Damn Cool Algorithms post, we learned about Fountain Codes, a clever probabilistic algorithm that allows you break a large file up into a virtually infinite number of small chunks, such that you can collect any subset of those chunks - as long as you collect a few more than the volume of the original file - and be able to reconstruct the original file.
-
Setting up Static and Dynamic (LACP) Link Aggregation (802.3ad) on D-LINK DES-3526/DES-3550 using the CLI.
-
Vert.x + Yoke (Polyglot Answer to Node.js + Express) + WebSockets on many clouds
-
Concatenating and removing duplicates from two files
-
Import folder of documents with Apache Solr 4.0 and tika
-
Dojo FAQ: Why doesn't my mouse event have pageX/Y or layerX/Y? Doesn't Dojo normalize events?
-
Improving Collaboration of Testers and Developers in Agile Teams
Add your comment
Voters For This Link (11)
-
dotCore -
mswatcher -
bogdansandu -
sstevenmendenhall -
harryrichardson -
webmaisterpro -
zesheppard -
hulk_god -
mantrid -
pertra
-
Topnotch
