# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

7 Pages

### cs221-section7

Course: CS 221, Fall 2009
School: Stanford
Rating:

Word Count: 2288

#### Document Preview

Section CS221 7 1 CS 221 Section 7: Bayesian Networks 1. Chocolate Bayesian Networks Suppose you have nally graduated and have your dream job of supervising the labeling chocolate that is being produced in a factory. There are two levers controlling production, one that controls whether the chocolate is plain or almond, and another that controls whether there is coconut or not. The levers are faulty, and will...

Register Now

#### Unformatted Document Excerpt

Coursehero >> California >> Stanford >> CS 221

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Stanford - CS - 221
Markov Decision ProcessesCS 221 Section 6October 30, 2009Today we will discuss several sample MDP problems. The solutions are included here, so you can work through them on your own if you like. 1. MDPs with Random Stopping Times Suppose we have a Mark
Stanford - CS - 221
Decision TreesCS 221 Section 5October 23, 2009Today we will work through an example problem of creating a decision tree. Time permitting, we will also work an example problem about AdaBoost.1Creating a decision treeConsider the criteria for acceptin
Stanford - CS - 221
Logistic Regression and Decision TreesCS 221 Section 4October 16, 2009Today we will derive the gradient descent update rule for logistic regression using maximum likelihood and also go over an example of creating decision trees.1Maximum likelihoodMa
Stanford - CS - 221
Probability Review CS 221 Section 3Olga Russakovsky October 12, 20091Random variablesConsider running a probabilistic experiment, e.g., tossing a coin. Let be the set of all possible outcomes of this experiment, called the sample space. In this case,
Stanford - CS - 221
% CS221, Fall 2009-10 % Matlab Review Session % % % % % % % % % % % To run matlab, first login to one of the clusters (such as myth.stanford.edu) using SecureCRT on Windows or typing from the command line: &gt; ssh username@myth.stanford.edu -X Then, to run
Stanford - CS - 221
Basic SearchCS 221 Section 1September 25, 20091IntroductionToday we will discuss some basic blind search algorithms and work some example problems involving them. These algorithms should be a review for most of you, as you have probably seen them in
Stanford - CS - 221
CS221:LittleDog RobotProjectZicoKolter,PaulBaumstarckLittleDogRobotLittleDogRobotLittleDogRobotSimulatorGettingtheSimulator LittleDogsimulatorandcodeavailableat: /afs/ir/class/cs221/code/LittleDog Ignorecompilationwarnings make&amp;./mainpath Shouldbui
Stanford - CS - 221
CS221 Challenge Problem: Robot Dog1CS 221, Autumn 2009 Robot DogYou may work in teams of up to 3 students for this project. Some important dates: You must form a team by Friday, October 9, 11:59pm. Send us an email with your team details, as described
Rutgers - PHILOSOPHY - 730:201
Rutgers - PHILOSOPHY - 730:201
Rutgers - PHILOSOPHY - 730:201
Aberystwyth University - SCI - 001
Chapter 38 Angiosperm Reproduction and BiotechnologyLecture OutlineOverview: To Seed or Not to SeedSexual reproduction is not the sole means by which flowering plants reproduce. Many species can also reproduce asexually, creating offspring that are gen
Aarhus Universitet - ACCT - ACCT2
18.Because of unseasonably cold weather, the supply of oranges has substantially decreased. This statement indicates that: CA.the equilibrium quantity of oranges will rise.B.the demand for oranges will necessarily rise.C.the amount of oranges that
UIllinois - 942 - cs
AlgorithmsLecture 0: IntroductionWe should explain, before proceeding, that it is not our object to consider this program with reference to the actual arrangement of the data on the Variables of the engine, but simply as an abstract question of the natu
UIllinois - 942 - cs
AlgorithmsOur life is frittered away by detail. Simplify, simplify.Lecture 1: Recursion Henry David Thoreau The control of a large force is the same principle as the control of a few men: it is merely a question of dividing up their numbers. Sun Zi, Th
UIllinois - 942 - cs
AlgorithmsNon-Lecture C: Advanced Dynamic Programming TricksNinety percent of science ction is crud. But then, ninety percent of everything is crud, and its the ten percent that isnt crud that is important. [Theodore] Sturgeons Law (1953)CAdvanced Dyn
UIllinois - 942 - cs
AlgorithmsLecture 5: Randomized AlgorithmsThe rst nuts and bolts appeared in the middle 1400s. The bolts were just screws with straight sides and a blunt end. The nuts were hand-made, and very crude. When a match was found between a nut and a bolt, they
UIllinois - 942 - cs
AlgorithmsNon-Lecture E: Tail InequalitiesIf you hold a cat by the tail you learn things you cannot learn any other way. Mark TwainETail InequalitiesThe simple recursive structure of skip lists made it relatively easy to derive an upper bound on the
UIllinois - 942 - cs
AlgorithmsLecture 6: Treaps and Skip ListsI thought the following four [rules] would be enough, provided that I made a rm and constant resolution not to fail even once in the observance of them. The rst was never to accept anything as true if I had not
UIllinois - 942 - cs
AlgorithmsNon-Lecture F: Randomized Minimum CutJaques: But, for the seventh cause; how did you nd the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:bear your body more seeming, Audrey:as thus, sir. I did dislike the cut of a c
UIllinois - 942 - cs
AlgorithmsLecture 9: Scapegoat and Splay TreesEverything was balanced before the computers went off line. Try and adjust something, and you unbalance something else. Try and adjust that, you unbalance two more and before you know whats happened, the shi
UIllinois - 942 - cs
AlgorithmsNon-Lecture G: String MatchingWhy are our days numbered and not, say, lettered? Woody AllenGG.1String MatchingBrute ForceThe basic object that were going to talk about for the next two lectures is a string, which is really just an array.
UIllinois - 942 - cs
AlgorithmsNon-Lecture H: More String MatchingPhilosophers gathered from far and near To sit at his feat and hear and hear, Though he never was heard To utter a word But Abracadabra, abracadab, Abracada, abracad, Abraca, abrac, abra, ab! Twas all he had,
UIllinois - 942 - cs
UIllinois - 942 - cs
AlgorithmsLecture 11: Basic Graph PropertiesObie looked at the seein eye dog. Then at the twenty-seven 8 by 10 color glossy pictures with the circles and arrows and a paragraph on the back of each one. . . and then he looked at the seein eye dog. And th
UIllinois - 942 - cs
AlgorithmsLecture 13: Shortest PathsWell, ya turn left by the re station in the village and take the old post road by the reservoir and. . . no, that wont do. Best to continue straight on by the tar road until you reach the schoolhouse and then turn lef
UIllinois - 942 - cs
AlgorithmsLecture 14: All-Pairs Shortest PathsThe tree which lls the arms grew from the tiniest sprout; the tower of nine storeys rose from a (small) heap of earth; the journey of a thousand li commenced with a single step. Lao-Tzu, Tao Te Ching, chapte
UIllinois - 942 - cs
AlgorithmsLecture 15: Maximum Flows and Minimum CutsCol. Hogan: One of these wires disconnects the fuse, the other one res the bomb. Which one would you cut, Shultz? Sgt. Schultz: Dont ask me, this is a decision for an ofcer. Col. Hogan: All right. Whic
UIllinois - 942 - cs
AlgorithmsLecture 16: Max-Flow AlgorithmsA process cannot be understood by stopping it. Understanding must move with the ow of the process, must join it and ow with it. The First Law of Mentat, in Frank Herberts Dune (1965) Theres a difference between k
UIllinois - 942 - cs
On the history of combinatorial optimization (till 1960)Alexander Schrijver11. IntroductionAs a coherent mathematical discipline, combinatorial optimization is relatively young. When studying the history of the eld, one observes a number of independent
UIllinois - 942 - cs
AlgorithmsLecture 17: Applications of Maximum FlowFor a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid machine with the ability to do incredibly smart thin
UIllinois - 942 - cs
AlgorithmsLecture 18: Extensions of Maximum FlowWho are you?&quot; said Lunkwill, rising angrily from his seat. What do you want?&quot; I am Majikthise!&quot; announced the older one. And I demand that I am Vroomfondel!&quot; shouted the younger one. Majikthise turned on V
UIllinois - 942 - cs
AlgorithmsNon-Lecture J: Linear Programming AlgorithmsSimplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.
UIllinois - 942 - cs
AlgorithmsLecture 20: Adversary ArgumentsAn adversary means opposition and competition, but not having an adversary means grief and loneliness. Zhuangzi (Chuang-tsu) c. 300 BC It is possible that the operator could be hit by an asteroid and your \$20 cou
UIllinois - 942 - cs
AlgorithmsLecture 21: NP-Hard ProblemsThe wonderful thing about standards is that there are so many of them to choose from. Real Admiral Grace Murray Hopper If a problem has no solution, it may not be a problem, but a fact not to be solved, but to be co
UIllinois - 942 - cs
AlgorithmsNon-Lecture K: Approximation AlgorithmsLe mieux est lennemi du bien. [The best is the enemy of the good.] Voltaire, La Bgueule (1772) Who shall forbid a wise skepticism, seeing that there is no practical question on which any thing more than a
UIllinois - 942 - cs
AlgorithmsNon-Lecture M: Number-Theoretic AlgorithmsAnd its one, two, three, What are we ghting for? Dont tell me, I dont give a damn, Next stop is Vietnam; [or: This time well kill Saddam] And its ve, six, seven, Open up the pearly gates, Well there ai
UIllinois - 942 - cs
AlgorithmsNon-Lecture N: Convex HullsNN.1Convex HullsDenitionsWe are given a set P of n points in the plane. We want to compute something called the convex hull of P . Intuitively, the convex hull is what you get by driving a nail into the plane at
UIllinois - 942 - cs
AlgorithmsAppendix: Solving Recurrences. . . O Zarathustra, who you are and must become behold you are the teacher of the eternal recurrence that is your destiny! That you as the rst must teach this doctrine how could this great destiny not be your grea
UIllinois - 942 - cs
CS 373Homework 1 (due 2/9/99)Spring 1999CS 373: Combinatorial Algorithms, Spring 1999http:/www-courses.cs.uiuc.edu/~cs373 Homework 1 (due February 9, 1999 by noon)Name: Net ID:Alias:Everyone must do the problems marked . Problems marked are for 1-u
UIllinois - 942 - cs
CS 373Homework 2 (due 2/18/99)Spring 1999CS 373: Combinatorial Algorithms, Spring 1999http:/www-courses.cs.uiuc.edu/~cs373 Homework 2 (due Thu. Feb. 18, 1999 by noon)Name: Net ID:Alias:Everyone must do the problems marked . Problems marked are for
UIllinois - 942 - cs
CS 373Homework 3 (due 3/11/99)Spring 1999CS 373: Combinatorial Algorithms, Spring 1999http:/www-courses.cs.uiuc.edu/~cs373 Homework 3 (due Thu. Mar. 11, 1999 by noon)Name: Net ID:Alias:Everyone must do the problems marked . Problems marked are for
UIllinois - 942 - cs
CS 373Homework 0 (due 1/26/99)Spring 1999CS 373: Combinatorial Algorithms, Spring 1999http:/www-courses.cs.uiuc.edu/ cs373 Homework 0 (due January 26, 1999 by the beginning of class)Name: Net ID:Alias:Neatly print your name (rst name rst, with no c
UIllinois - 942 - cs
AlgorithmsNon-Lecture L: Fibonacci HeapsA little and a little, collected together, become a great deal; the heap in the barn consists of single grains, and drop and drop makes an inundation. Saadi (11841291) The trees that are slow to grow bear the best
UIllinois - 942 - cs
AlgorithmsNon-Lecture O: Line Segment IntersectionSpengler: Theres something very important I forgot to tell you. Venkman: What? Spengler: Dont cross the streams. Venkman: Why? Spengler: It would be bad. Venkman: Im fuzzy on the whole good/bad thing. Wh
UIllinois - 942 - cs
AlgorithmsNon-Lecture P: Polygon TriangulationIf triangles had a god, they would give him three sides. Charles Louis de Secondat Montesquie (1721) Down with Euclid! Death to triangles! Jean Dieudonn (1959)PP .1Polygon TriangulationIntroductionRecal
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Fall 2000Homework 0, due August 31, 2000 at the beginning of className: Net ID:Alias:Neatly print your name (rst name rst, with no comma), your network ID, and a short alias into the boxes above. Do not sign your name
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 1999Final Exam (May 7, 1999)Name: Net ID:Alias:This is a closed-book, closed-notes exam!If you brought anything with you besides writing instruments and your two 8 1 11 cheat sheets, please leave it at the fro
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Fall 2000Homework 0, due August 31, 2000 at the beginning of className: Net ID:Alias:Neatly print your name (rst name rst, with no comma), your network ID, and a short alias into the boxes above. Do not sign your name
UIllinois - 942 - cs
CS 373Homework 5 (due 4/22/99)Spring 1999CS 373: Combinatorial Algorithms, Spring 1999http:/www-courses.cs.uiuc.edu/~cs373 Homework 5 (due Thu. Apr. 22, 1999 by noon)Name: Net ID:Alias:Everyone must do the problems marked . Problems marked are for
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 1999Midterm 1 (February 23, 1999)Name: Net ID:Alias:This is a closed-book, closed-notes exam!If you brought anything with you besides writing instruments and your 8 1 11 cheat sheet, please leave it at the fro
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 1999Midterm 2 (April 6, 1999)Name: Net ID:Alias:This is a closed-book, closed-notes exam!If you brought anything with you besides writing instruments and your 8 1 11 cheat sheet, please leave it at the front o
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Fall 2000Homework 1 (due September 12, 2000 at midnight)Name: Net ID: Name: Net ID: Name: Net ID:Alias:U 3/4 1Alias:U 3/4 1Alias:U 3/4 1Starting with Homework 1, homeworks may be done in teams of up to three peop
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Fall 2000Homework 4 (due October 26, 2000 at midnight)Name: Net ID: Name: Net ID: Name: Net ID:Alias:U 3/4 1Alias:U 3/4 1Alias:U 3/4 1Homeworks may be done in teams of up to three people. Each team turns in just
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Fall 2000Homework 1 (due November 16, 2000 at midnight)Name: Net ID: Name: Net ID: Name: Net ID:Alias:U 3/4 1Alias:U 3/4 1Alias:U 3/4 1Starting with Homework 1, homeworks may be done in teams of up to three peopl
UIllinois - 942 - cs
CS 373 1. True, False, or MaybeFinal Exam (December 15, 2000)Fall 2000Indicate whether each of the following statments is always true, sometimes true, always false, or unknown. Some of these questions are deliberately tricky, so read them carefully. Ea
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 2001Homework 0, due January 23, 2001 at the beginning of className: Net ID:Alias:Neatly print your name (rst name rst, with no comma), your network ID, and a short alias into the boxes above. Do not sign your n
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 2001Homework 1 (due Thursday, February 1, 2001 at 11:59:59 p.m.)Name: Net ID: Name: Net ID: Name: Net ID:Alias:U 3/4 1Alias:U 3/4 1Alias:U 3/4 1Starting with Homework 1, homeworks may be done in teams of u
UIllinois - 942 - cs
CS 373Midterm 2 (October 31, 2000)Fall 20001. Using any method you like, compute the following subgraphs for the weighted graph below. Each subproblem is worth 3 points. Each incorrect edge costs you 1 point, but you cannot get a negative score for any
UIllinois - 942 - cs
CS 373: Combinatorial Algorithms, Spring 2001http:/www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.)Name: Net ID: Name: Net ID: Name: Net ID:Alias:U 3/4 1Alias:U 3/4 1Alias:U 3/4 1Starting with Homework 1, homework
UIllinois - 942 - cs
CS 373Midterm 1 Questions (February 20, 2001)Spring 2001Write your answers in the separate answer booklet.1. Multiple Choice: Each question below has one of the following answers. (a) (1) (b) (log n) (c) (n) (d) (n log n) (e) (n2 )For each question,