https://www.bibsonomy.org/user/muehlburger/algorithmsBibSonomy RSS Feed for /user/muehlburger/algorithmshttp://www.cs.berkeley.edu/~vazirani/algorithms.htmlmuehlburger2012-03-06T20:16:00+01:00algorithms <a itemprop="url" data-versiondate="2012-03-06T20:16:00+01:00" href="http://www.cs.berkeley.edu/~vazirani/algorithms.html" rel="nofollow" class="description-link">http://www.cs.berkeley.edu/~vazirani/algorithms.html</a>http://highlyscalable.wordpress.com/2012/02/01/mapreduce-patterns/muehlburger2012-02-28T17:37:27+01:00algorithms design-patterns hadoop mapreduce <a itemprop="url" data-versiondate="2012-02-28T17:37:27+01:00" href="http://highlyscalable.wordpress.com/2012/02/01/mapreduce-patterns/" rel="nofollow" class="description-link">http://highlyscalable.wordpress.com/2012/02/01/mapreduce-patterns/</a>http://people.revoledu.com/kardi/tutorial/kMean/NumericalExample.htmmuehlburger2012-02-24T21:42:05+01:00algorithms classification clustering datamining ewv example k-means tutorial <a itemprop="url" data-versiondate="2012-02-24T21:42:05+01:00" href="http://people.revoledu.com/kardi/tutorial/kMean/NumericalExample.htm" rel="nofollow" class="description-link">http://people.revoledu.com/kardi/tutorial/kMean/NumericalExample.htm</a>http://www.snl.salk.edu/~shlens/pub/notes/pca.pdfmuehlburger2012-02-24T21:42:05+01:00algorithm algorithms analysis ewv filetype:pdf math mathematics media:document pca pdf programming reference science statistics tutorial <a itemprop="url" data-versiondate="2012-02-24T21:42:05+01:00" href="http://www.snl.salk.edu/~shlens/pub/notes/pca.pdf" rel="nofollow" class="description-link">http://www.snl.salk.edu/~shlens/pub/notes/pca.pdf</a>http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/VideoLectures/index.htmmuehlburger2012-02-24T21:42:05+01:00algorithm algorithms eaa09 lectures mit programming reference video videos <a itemprop="url" data-versiondate="2012-02-24T21:42:05+01:00" href="http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/VideoLectures/index.htm" rel="nofollow" class="description-link">http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/VideoLectures/index.htm</a>http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-seven/muehlburger2012-02-24T21:42:05+01:00algorithm algorithms datastructures eaa09 education lectures mit programming video videos <a itemprop="url" data-versiondate="2012-02-24T21:42:05+01:00" href="http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-seven/" rel="nofollow" class="description-link">http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-seven/</a>http://duineframework.org/muehlburger2012-02-24T21:42:02+01:00ai algorithms collaborative_filtering duine framework java opensource programming recommendation recommender software <a itemprop="url" data-versiondate="2012-02-24T21:42:02+01:00" href="http://duineframework.org/" rel="nofollow" class="description-link">http://duineframework.org/</a>http://nlp.stanford.edu/IR-book/html/htmledition/irbook.htmlmuehlburger2012-02-24T21:42:00+01:00algorithms book datamining ebook informationretrieval ir machinelearning reference retrieval search wissensverarbeitung <a itemprop="url" data-versiondate="2012-02-24T21:42:00+01:00" href="http://nlp.stanford.edu/IR-book/html/htmledition/irbook.html" rel="nofollow" class="description-link">http://nlp.stanford.edu/IR-book/html/htmledition/irbook.html</a>http://www.scribd.com/doc/35539144/pnp12ptmuehlburger2012-02-24T21:41:55+01:00algorithms cs math mathematics p-np paper papers programming pvsnp research <a itemprop="url" data-versiondate="2012-02-24T21:41:55+01:00" href="http://www.scribd.com/doc/35539144/pnp12pt" rel="nofollow" class="description-link">http://www.scribd.com/doc/35539144/pnp12pt</a>http://www.cs.princeton.edu/introcs/41analysis/muehlburger2012-02-24T21:41:55+01:00algorithm algorithms analysis development google interview programming questions time <a itemprop="url" data-versiondate="2012-02-24T21:41:55+01:00" href="http://www.cs.princeton.edu/introcs/41analysis/" rel="nofollow" class="description-link">http://www.cs.princeton.edu/introcs/41analysis/</a>http://algowiki.net/wiki/index.php?title=Special:Allpagesmuehlburger2012-02-24T21:41:52+01:00algorithm algorithms eaa programming <a itemprop="url" data-versiondate="2012-02-24T21:41:52+01:00" href="http://algowiki.net/wiki/index.php?title=Special:Allpages" rel="nofollow" class="description-link">http://algowiki.net/wiki/index.php?title=Special:Allpages</a>http://courses.csail.mit.edu/6.006/fall10/notes.shtmlmuehlburger2012-02-24T21:41:52+01:00algorithms eaa eaa09 entwurf-und-analyse-von-algorithmen <a itemprop="url" data-versiondate="2012-02-24T21:41:52+01:00" href="http://courses.csail.mit.edu/6.006/fall10/notes.shtml" rel="nofollow" class="description-link">http://courses.csail.mit.edu/6.006/fall10/notes.shtml</a>http://eriwen.com/books/best-algorithms-book/#comment-5457muehlburger2012-02-24T21:41:52+01:00algorithms eaa09 <a itemprop="url" data-versiondate="2012-02-24T21:41:52+01:00" href="http://eriwen.com/books/best-algorithms-book/#comment-5457" rel="nofollow" class="description-link">http://eriwen.com/books/best-algorithms-book/#comment-5457</a>http://www.cs.sunysb.edu/~algorith/muehlburger2012-02-24T21:41:52+01:00algorithms code cs development eaa09 programming <a itemprop="url" data-versiondate="2012-02-24T21:41:52+01:00" href="http://www.cs.sunysb.edu/~algorith/" rel="nofollow" class="description-link">http://www.cs.sunysb.edu/~algorith/</a>http://www.cs.princeton.edu/~rs/muehlburger2012-02-24T21:41:52+01:00algorithm algorithms book c++ computerscience java people programming sedgewick <a itemprop="url" data-versiondate="2012-02-24T21:41:52+01:00" href="http://www.cs.princeton.edu/~rs/" rel="nofollow" class="description-link">http://www.cs.princeton.edu/~rs/</a>http://algs4.cs.princeton.edu/code/muehlburger2012-02-24T21:41:51+01:00algorithm algorithms api geek programming <a itemprop="url" data-versiondate="2012-02-24T21:41:51+01:00" href="http://algs4.cs.princeton.edu/code/" rel="nofollow" class="description-link">http://algs4.cs.princeton.edu/code/</a>http://www.tsp.gatech.edu/index.htmlmuehlburger2012-02-24T21:41:51+01:00ai algorithm algorithms graph math optimization problem programming search tsp <a itemprop="url" data-versiondate="2012-02-24T21:41:51+01:00" href="http://www.tsp.gatech.edu/index.html" rel="nofollow" class="description-link">http://www.tsp.gatech.edu/index.html</a> Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. The programming model provides an easy-to-understand abstraction for designing scalable algorithms, while the execution framework transparently handles many system-level details, ranging from scheduling to synchronization to fault tolerance. This book focuses on MapReduce algorithm design, with an emphasis on text processing algorithms common in natural language processing, information retrieval, and machine learning. We introduce the notion of MapReduce design patterns, which represent general reusable solutions to commonly occurring problems across a variety of problem domains. This book not only intends to help the reader "think in MapReduce", but also discusses limitations of the programming model as well.http://www.morganclaypool.com/doi/abs/10.2200/S00274ED1V01Y201006HLT007muehlburger2010-05-10T09:10:19+02:00Algorithm Algorithms Design EM Graph Indexing Inverted MapReduce Processing Retrieval Text for <span itemprop="description"> Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. The programming model provides an easy-to-understand abstraction for designing scalable algorithms, while the execution framework transparently handles many system-level details, ranging from scheduling to synchronization to fault tolerance. This book focuses on MapReduce algorithm design, with an emphasis on text processing algorithms common in natural language processing, information retrieval, and machine learning. We introduce the notion of MapReduce design patterns, which represent general reusable solutions to commonly occurring problems across a variety of problem domains. This book not only intends to help the reader &#034;think in MapReduce&#034;, but also discusses limitations of the programming model as well.</span>http://www.umiacs.umd.edu/~jimmylin/book.htmlmuehlburger2010-05-10T09:02:01+02:00algorithms awm2010 book books datamining distributed hadoop mapreduce programming <a itemprop="url" data-versiondate="2010-05-10T09:02:01+02:00" href="http://www.umiacs.umd.edu/~jimmylin/book.html" rel="nofollow" class="description-link">http://www.umiacs.umd.edu/~jimmylin/book.html</a>http://atbrox.com/2010/05/08/mapreduce-hadoop-algorithms-in-academic-papers-may-2010-update/muehlburger2010-05-10T08:56:04+02:00algorithms awm2010 awmhadoop hadoop mapreduce papers publications <a itemprop="url" data-versiondate="2010-05-10T08:56:04+02:00" href="http://atbrox.com/2010/05/08/mapreduce-hadoop-algorithms-in-academic-papers-may-2010-update/" rel="nofollow" class="description-link">http://atbrox.com/2010/05/08/mapreduce-hadoop-algorithms-in-academic-papers-may-2010-update/</a>