Ternary Search is an interval-based divide-and-conquer algorithm for finding the minimum of a unimodal function. This video describes how to find a minimum when the derivative is know, defines unimodal, presents interval-based approaches for minimum finding, and visualizes the algorithm. E
From playlist Numerical Methods
Dichotomous Search is an improved version of Ternary Search. This video describes the motivation and algorithm followed by a visualized example. Code can be found on GitHub https://www.github.com/osveliz/numerical-veliz *Correction* The numerical example used epsilon = 10^(-6) not 10^(-7)
From playlist Numerical Methods
Check if a binary tree is binary search tree or not
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have written a program in C/C++ to verify whether a given binary tree is binary search tree or not. For practice problems and more, visit: http://www.m
From playlist Data structures
In this video we look at how we can view the schema on existing tables in MariaDB or MySQL. We can use statements, SHOW TABLES, DESCRIBE TABLE or SHOW CREATE TABLE Additionally you can find my video courses on Pluralsight: http://pluralsight.com/training/Authors/Details/andrew-mallett and
From playlist MariaDB and MySQL Databases
Adding Vectors Geometrically: Dynamic Illustration
Link: https://www.geogebra.org/m/tsBer5An
From playlist Trigonometry: Dynamic Interactives!
Data structures: Binary Search Tree
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed binary search tree data structure. Binary search is an efficient data structure in which we can store data to get search, insertion and de
From playlist Data structures
This shows a 3d printed mobile produced using shapeways.com. This is joint work with Marco Mahler. This is available at http://shpws.me/nPhe.
From playlist 3D printing
From playlist CS50 Sections 2012
Composing Trig & Inverse Trig Functions (2)
Evaluating compositions of #trig & inverse #trig functions: More quick formative assessment via #geogebra: https://www.geogebra.org/m/rwpkkmt7 & https://www.geogebra.org/m/hcw4fr6t #MTBoS #ITeachMath #trigonometry #precalc #math #mathchat
From playlist Trigonometry: Dynamic Interactives!
Stanford Lecture: Donald Knuth—"(3/2)-ary Trees" (2014)
Donald Knuth's 20th Annual Christmas Tree Lecture: (3/2)-ary Trees (2014) December 2, 2014 In previous lectures Professor Knuth has discussed binary trees, ternary trees, quaternary trees, etc., which are enumerated by the coefficients of important functions called generalized binomial se
From playlist Donald Knuth Lectures
What Lies Beneath - A Deep Dive Into Clojure's Data Structures - Mohit Thatte
Immutable, persistent data structures are at the heart of Clojure's philosophy. It is instructive to see how these are implemented, to appreciate the trade-offs between persistence and performance. Lets explore the key ideas that led to effective, practical implementations of these data st
From playlist Clojure, Lisp
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority - Ashwin Nayak
Ashwin Nayak University of Waterloo April 4, 2011 Recursive Majority-of-three (3-Maj) is a deceptively simple problem in the study of randomized decision tree complexity. The precise complexity of this problem is unknown, while that of the similarly defined Recursive NAND tree is completel
From playlist Mathematics
Live CEOing Ep 587: Language Design Review of Visualization Features
In this episode of Live CEOing, Stephen Wolfram discusses upcoming improvements and features to the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen Wolfram
From playlist Behind the Scenes in Real-Life Software Design
Lecture 15 | Efficient Methods and Hardware for Deep Learning
In Lecture 15, guest lecturer Song Han discusses algorithms and specialized hardware that can be used to accelerate training and inference of deep learning workloads. We discuss pruning, weight sharing, quantization, and other techniques for accelerating inference, as well as parallelizati
From playlist Lecture Collection | Convolutional Neural Networks for Visual Recognition (Spring 2017)
38: Complexity & Trees - Richard Buckland UNSW
Searching, best worst and expected case. Binary search and insert - linked lists vs arrays. Trees. Ordered binary trees. 3 interesting books: Puzzle Guide to Godel (Raymond Smullyan), Surely you're joking Mr Feynman (Richard Feynman), Alice/Annotated Alice (Lewis Carrol/Martin Gardin
From playlist CS1: Higher Computing - Richard Buckland UNSW
This shows a 3d printed mobile produced using shapeways.com. This is joint work with Marco Mahler. This is available at http://shpws.me/nPha.
From playlist 3D printing
Golden-section Search is a minimization algorithm that expands on the Fibonacci Search scheme described by J. Kiefer and S. M. Johnson. This interval-based numerical method improves on Ternary Search and Dichotomous Search be reusing interval points based on the golden ratio (phi). Code ca
From playlist Numerical Methods
Introduction to Trigonometry: Angles and Radians
Alright, it's time to get into some more challenging math! Trigonometry is a subject that many people find intimidating, but once you understand some new ways to look at angles and some functions that pertain to them, it's really not so bad! First things first, let's make sure we understan
From playlist Trigonometry