Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2014:journals:eric:home [2014/03/31 14:34] – [7.2 max flows and min cuts in a network] utomoecourses:cs211:winter2014:journals:eric:home [2014/03/31 14:36] (current) – [Eric's Journal] utomoe
Line 1: Line 1:
 ====== Eric's Journal ====== ====== Eric's Journal ======
-Interest:+Interest: 7/10. this is back to bit too abstract for me. maybe (in fact probably) this week's reading will help out if I take big data class this fall. it seems network flow would be huge part of big data since it's about partitioning too big a set to compute with x resources into smaller sets with x*y resources
 ===== Week 11 Reading ===== ===== Week 11 Reading =====
 ====7.1 The Max-Flow Prob and the Ford-Fulkerson Alg==== ====7.1 The Max-Flow Prob and the Ford-Fulkerson Alg====
courses/cs211/winter2014/journals/eric/home.1396276474.txt.gz · Last modified: 2014/03/31 14:34 by utomoe
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0