User contributions
From 6.006 Introduction to Algorithms
- 18:33, 12 February 2008 (diff | hist) Lectures and Recitations
- 14:12, 7 February 2008 (diff | hist) Document Distance Program Version 6 (Undo revision 20 by 128.30.44.145 (Talk))
- 14:11, 7 February 2008 (diff | hist) Document Distance Program Version 6 (printable version)
- 19:34, 5 February 2008 (diff | hist) Lectures and Recitations
- 19:33, 5 February 2008 (diff | hist) Lectures and Recitations
- 18:32, 4 February 2008 (diff | hist) N Document Distance Program Version 6 (New page: To improve the running time of our document distance program, we replace <tt>insertion_sort</tt> with <tt>merge_sort</tt>, which is known to run in time <math>\Theta(n\lg n)</math>, inste...)
- 18:32, 4 February 2008 (diff | hist) N Document Distance Program Version 5 (New page: The <tt>get_words_from_string</tt> routine is ''character-oriented'': it must do some processing on ''each character'' of the input file(s). Thus, although the running time of this routi...)
- 18:31, 4 February 2008 (diff | hist) N Document Distance Program Version 4 (New page: The problem with <tt>count_frequency</tt> is that for each word in the text file, it searches linearly down the list of word/frequency pairs to find the given word. Thus, if the docum...)
- 18:31, 4 February 2008 (diff | hist) N Document Distance Program Version 3 (New page: Ah -- The problem is that concatenating two lists takes time proportional to the sum of the lengths of the two lists, since each list is copied into the output list! Therefore, building ...)
- 18:31, 4 February 2008 (diff | hist) N Document Distance Program Version 2 (New page: In order to figure out why our initial program is so slow, we now "instrument" the program so that Python will tell us where the running time is going. This is very simple in Python; we si...)
- 18:30, 4 February 2008 (diff | hist) N Document Distance Program Version 1 (New page: The initial version of our program for computing the distance between two documents is here: [http://courses.csail.mit.edu/6.006/fall07/source/docdist1.py http://courses.csail.mit.edu/6.00...)
- 18:30, 4 February 2008 (diff | hist) N Document Distance Data Sets (New page: Here are nine sample text files, mostly from [http://www.gutenberg.org/wiki/Main_Page Project Gutenberg] for use as input files for the document distance problem: * <tt>t1.verne.txt</tt>:...) (top)
- 18:30, 4 February 2008 (diff | hist) N Document Distance Problem Definition (New page: Let D be a text document (e.g. the complete works of William Shakespeare). A ''word'' is a consecutive sequence of alphanumeric characters, such as "Hamlet" or "2007". We'll treat all ...) (top)
- 18:29, 4 February 2008 (diff | hist) N Document Distance (New page: * Document Distance Problem Definition * Document Distance Data Sets * Document Distance Program Version 1 * Document Distance Program Version 2 * [[Document Distance Progr...)
- 18:29, 4 February 2008 (diff | hist) N Python Cost Model (New page: Python is a high-level programming language, with many powerful primitives. Analyzing the running time of a Python program requires an understanding of the cost of the various Python prim...) (top)
- 18:28, 4 February 2008 (diff | hist) Main Page (→Modules)
- 18:27, 4 February 2008 (diff | hist) N Python-mode for Emacs on Athena (New page: === For GNU Emacs (emacs) on Athena === We have installed a Python mode, supporting indentation, syntax highlighting, and other useful features, in the 6.006 locker (because one is not ins...) (top)
- 18:27, 4 February 2008 (diff | hist) Main Page
