Sets
sort by: Relevancy | Title | Rating try advanced search for more options
-
Note: This course is being offered by Stanford this summer as an online course for credit. It can be taken individually, or as part of a master’s degree or graduate certificate earned online through the Stanford Center for Professional Development. This course is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++...more
-
Concentrates on recognizing and solving convex optimization problems that arise in engineering. Topics include: Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Interiorpoint methods. Applications to signal...more
-
The purpose of this course is to introduce you to basics of modeling, design, planning, and control of robot systems. In essence, the material treated in this course is a brief survey of relevant results from geometry, kinematics, statics, dynamics, and control. The course is presented in a standard format of lectures, readings and problem sets. Lectures will be based mainly, but not exclusively, on material in the Lecture Notes....more
-
This lecture covers Paradise XXIV-XXVI. In the Heaven of the Fixed Stars, Dante is examined on the three theological virtues by the apostles associated with each: St. Peter with faith (Paradise XXIV), St. James with hope (Paradise XXV), and St. John with love (Paradise XXVI). While mastering these virtues is irrelevant to the elect, it is crucial to the message of reform the pilgrim-turned-poet will relay on his return home. Dante's...more
-
More Detail about Activation Records - Layout of Memory During a Function Call
Stanford / Computer Science

More Detail about Activation Records - Layout of Memory During a Function Call, How the Return Address of a Function is Stored on the Stack, Example Showing How an Activation Record is Constructed on the Stack, Setting Up Function Parameters on the Stack, Using the Call Instruction to Jump to the Function, Cleaning Up at the End of a Function and Using the RET Instruction and the Saved Return Address to Return to the Original Function,...more
-
We consider games that have both simultaneous and sequential components, combining ideas from before and after the midterm. We represent what a player does not know within a game using an information set: a collection of nodes among which the player cannot distinguish. This lets us define games of imperfect information; and also lets us formally define subgames. We then extend our definition of a strategy to imperfect information games,...more
-
In this lecture, Professor Freeman discusses the Declaration of Independence and sets the document in its historical context. The Declaration was not the main focus of the Second Continental Congress, which was largely concerned with organizing the defensive war effort. The Congress had sent King George III the Olive Branch Petition in a last attempt at reconciliation in August 1775, but the King ignored the petition and declared the...more
-
December 7, 2007 lecture by Brian Lee for the Human-Computer Interaction Seminar (CS 547). Today's designers generate content both on paper and online. Designers spread their work over physical and digital media, each of which has powerful, but distinct, sets of affordances. Recent work suggests that augmented paper interfaces can marry the ubiquity of paper interactions with the ease of search, annotation, and presentation afforded by...more
-
Medtronic, Boston Scientific, and Johnson & Johnson all began as single-product ventures, says Mir Imran, CEO of InCube Labs and serial entrepreneur of medical devices. And while the medical community is rife with single-product ventures, a few of them do go on to become large enterprises offering a suite of products in multiple markets. What sets the bar for each venture? The market viability for each product they produce.
-
Convergence Proof, Stopping Criterion, Example: Piecewise Linear Minimization, Optimal Step Size When F* Is Known, Finding A Point In The Intersection Of Convex Sets, Alternating Projections, Example: Positive Semidefinite Matrix Completion, Speeding Up Subgradient Methods, A Couple Of Speedup Algorithms, Subgradient Methods For Constrained Problems, Projected Subgradient Method, Linear Equality Constraints, Example: Least L_1-Norm
-
Course Logistics, Course Organization, Course Topics, Subgradients, Basic Inequality, Subgradient Of A Function, Subdifferential, Subgradient Calculus, Some Basic Rules (For Subgradient Calculus), Pointwise Supremum, Weak Rule For Pointwise Supremum, Expectation, Minimization, Composition, Subgradients And Sublevel Sets, Quasigradients
-
Linear Discrimination (Cont.), Robust Linear Discrimination, Approximate Linear Separation Of Non-Separable Sets, Support Vector Classifier, Nonlinear Discrimination, Placement And Facility Location, Numerical Linear Algebra Background, Matrix Structure And Algorithm Complexity, Linear Equations That Are Easy To Solve, The Factor-Solve Method For Solving Ax = B, LU Factorization


