engineering of computer applications
sort by: Relevancy | Title try advanced search for more options
-
Bias/variance Tradeoff, Empirical Risk Minimization (ERM), The Union Bound, Hoeffding Inequality, Uniform Convergence - The Case of Finite H, Sample Complexity Bound, Error Bound, Uniform Convergence Theorem & Corollary
-
Biased random walks, distributions
-
Binary Numbers, Programming Languages, Working in Linux, and Programming in C
Harvard / Computer Science
-
Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.
-
Binary search, bubble and selection sorts
-
Bioengineering: Supporting Innovation Across Disciplines in a University Setting
Stanford / Entrepreneurship
Hennessy explains that the Clark Center is important to the future of Stanford because it represents the growing importance of biology to the coming century. It is a radical organization for a university because it brings together faculty from a broad range of departments in an attempt to understand the translation between basic science and the applications of basic science.
-
Bisection methods, Newton/Raphson, introduction to lists
-
-
Krishna Shenoy is creating "brain-computer interfaces" that will enable paralyzed patients to control prosthetic arms and computer cursors. In this short talk, Shenoy describes how his team of Stanford researchers has built a system that achieves typing at 15 words-per-minute, just by "thinking about it".
-
-
Buffer: Vector vs Stack, Buffer as Linked List, Cursor Design, Use of Dummy Cell, Linked List Insert/delete, Linked List Cursor Movement, Compare Implementation, Doubly Linked List, Compare Implementation, Space Time Trade Off, Implementing Map, Simple Map Implementation: Vector, Map as Vector : Performance Implication, A Different Strategy
-
