Slides #7: Greedy Clustering

Let’s work some problems centering on pictures of Naomi. (The primary target of my image-capturing devices.)

Just for fun: UBC CS’s most cited paper (last I checked!), by David Lowe, looks at how to find similar features between images using the SIFT algorithm.

Our reading question was to determine for a particular interval in the following unweighted scheduling problem whether that interval would be considered by the textbook’s greedy algorithm before or after the interval labeled A. Which interval you needed to look at depended on your section and student #.


Leave a Reply

Your email address will not be published. Required fields are marked *