Today we’ll finish working on clustering of photos!
- For next time, read Sections 4.7. No pre-class quiz, however.
- Here’s a set of notes to wrap up photo clustering.
Today we’ll finish working on clustering of photos!
Today we’ll continue working on clustering of photos with a graph-based approach.
Today we’ll move on to two new questions about graphs: how do you find the most “influential” nodes in a directed graph (if an edge confers a small amount of influence from its tail to its head) AKA the Google Guide to How to Win at Search, and how do you cluster nodes in a graph (if an edge’s weight denotes similarity)?
We’re continuing our work with graphs today.
Today we’ll start working with graphs. We’re going to play around with the concepts of “diameter” and “articulation point” just to get some experience with graphs. We’ll also spend some time with the DFS and BFS algorithms.
We’ll finish up our review of asymptotic analysis today. Don’t spend the whole day on that crazy square-root-of-n-to-the-square-root-of-n function! 🙂
A few notes:
Today we’ll review and play with asymptotic analysis. These notes will have a different feel, as we’re not solving an algorithmic problem but performing analysis on algorithms (or, in some cases, performing bits and pieces of that analysis).
A few notes:
We’re in our new classroom today! (Swing 121)
We’ll continue working on the resident-hospital matching problem.
A few notes:
Today we’ll finish the first stable marriage handout and start talking about the critical concept of reductions.
Important notes for today:
Justification of our in-class screen policy: Research has shown that you inhibit your own learning (or at least grades) by using screens for unrelated purposes during class. But, you’re adults; so, that’s your choice. However, you also inhibit the learning of those around you, which you have no right to do. (Similarly, no smoking in the classroom, please.)