Search for tag: "algorithm"

2.22.21 Theory Seminar - SP21 Jason Gaitonde, Cornell University

Zoom Recording ID: 92032593202 UUID: kaFzSEsLRVGA1n+BFhDrkw== Meeting Time: 2021-02-22T20:46:25Z

From  Jordan Staiti on February 22nd, 2021 2 plays

ORIE Colloquium - Yilun Chen/Benjamin Grimmer (Cornell University), February 16, 2021

Yilun ChenTitle: Beating the curse of dimensionality in data-driven online decision-making Abstract: Data-driven online decision-making tasks arise frequently in various practical settings in…

From  Henry Lam on February 16th, 2021 0 plays

ORIE Colloquium - Courtney Paquette (McGill University), February 9, 2021

“Halting Time is Predictable for Large Models: A Universality Property and Average-case Analysis” In this talk, I will present a framework for performing average-case analysis in…

From  Henry Lam on February 9th, 2021 0 plays

Lesson 30.8 Quicksort Performance

It looks like quicksort has solved our performance problems. However, we should not be so hasty. In this video, we look at the real performance for quicksort, and why it is not perfect. We also talk…

From  Hannah Lee on December 10th, 2020 8 plays

Lesson 30.7 Quicksort

The partition algorithm breaks up the list into two kind-of-sorted portions. In this video, we show how to use this fact with divide-and-conquer to implement a new sorting algorithm: quicksort. For…

From  Hannah Lee on December 10th, 2020 9 plays

Lesson 30.6 The Partition algorithm

In the previous video, we saw that nested loops are causing our sorting algorithms to be slow. To speed things up, we need to get rid of one of these loops. To do that, we will need a special…

From  Hannah Lee on December 10th, 2020 8 plays

Lesson 30.5 Selection Sort

In the previous video we saw that insertion sort is not an ideal sorting algorithm. In this video we try our hand at another algorithm: selection sort. This is another simple algorithm that may be…

From  Hannah Lee on December 10th, 2020 8 plays

Lesson 30.4 Sorting Performance

Through the course, we have only cared about specifications, and not performance. But as we see in this video, sorting is an application where performance really matters. Little changes to the size…

From  Hannah Lee on December 10th, 2020 9 plays

Lesson 30.3 Insertion Sort

In this video we introduce insertion sort, which is one of the simplest sorting algorithms to understand. If you have ever sorted cards in your hand it is likely that you have used this sorting…

From  Hannah Lee on December 10th, 2020 8 plays

Cornell IS Colloquium with Nathan Matias

Zoom Recording ID: 98959768127 UUID: cBYuzdmaRhO+l/JVxTmx5w== Meeting Time: 2020-12-03T20:45:43Z

From  Wendy Ju on December 3rd, 2020 9 plays

10.20 Theory Seminar - Fall 2020: Yanyi Liu, Cornell University

Zoom Recording ID: 97470844866 UUID: Rc1xL+sZRbmcGWwApOSxiQ== Meeting Time: 2020-10-19T20:00:54Z

From  Jordan Staiti on October 19th, 2020 60 plays

10.12.20 Theory Seminar - Fall 2020 Shachar Lovett, UC San Diego

Zoom Recording ID: 97470844866 UUID: 9mq56B39QvqqAWq7KYEL1g== Meeting Time: 2020-10-12T20:04:41Z

From  Jordan Staiti on October 12th, 2020 4 plays