User contributions
From 6.006 Wiki
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 20:50, 11 October 2008 (diff | hist) N MediaWiki:Sidebar (sidebar configuration)
- 20:50, 11 October 2008 (diff | hist) Nm MediaWiki:Lectures (sidebar url configuration) (top)
- 20:49, 11 October 2008 (diff | hist) Nm MediaWiki:Psets (sidebar url configuration) (top)
- 20:48, 11 October 2008 (diff | hist) Nm MediaWiki:Psets-url (sidebar url configuration) (top)
- 20:47, 11 October 2008 (diff | hist) Main Page (→Handout list)
- 20:46, 11 October 2008 (diff | hist) Quizzes
- 22:41, 7 October 2008 (diff | hist) Main Page (add H05 (ps3))
- 19:07, 7 October 2008 (diff | hist) Problem Sets
- 23:22, 6 October 2008 (diff | hist) PSet2 FAQ (→Questions)
- 01:52, 6 October 2008 (diff | hist) PSet2 FAQ
- 16:43, 3 October 2008 (diff | hist) Lectures and Recitations (move toc to right side so it's more out of the way)
- 16:42, 3 October 2008 (diff | hist) N Template:TOCright (New page: {| cellspacing="0" cellpadding="0" style="clear:right; margin-bottom: .5em; float: right; padding: .5em 0 .8em 1.4em; background: none; width: {{{1|auto}}};" | __TOC__ |}<noinclude> Floats...) (top)
- 22:14, 2 October 2008 (diff | hist) Main Page
- 21:23, 29 September 2008 (diff | hist) Main Page
- 21:19, 29 September 2008 (diff | hist) Problem Sets
- 06:23, 29 September 2008 (diff | hist) Problem Sets
- 05:25, 29 September 2008 (diff | hist) m Problem Sets (code tag does something weird, using tt instead)
- 03:38, 29 September 2008 (diff | hist) Problem Sets (ps1 solutions)
- 17:16, 25 September 2008 (diff | hist) Lectures and Recitations
- 05:57, 19 September 2008 (diff | hist) Document Distance (top)
- 05:55, 19 September 2008 (diff | hist) Document Distance Program Using Dictionaries ((incl. last revision) cp from spring 08) (top)
- 05:55, 19 September 2008 (diff | hist) N Document Distance Program Using Dictionaries (New page: Here is one more version of the document distance code which uses hashing more thoroughly. It achieves a running time of <math>\Theta(n)</math>. This linear time bound is optimal because...)
- 15:13, 11 September 2008 (diff | hist) Lectures and Recitations
- 23:26, 10 September 2008 (diff | hist) Lectures and Recitations
- 23:26, 10 September 2008 (diff | hist) Lectures and Recitations (add Bentley handout for Rec. 2)
- 18:44, 9 September 2008 (diff | hist) Lectures and Recitations
- 17:59, 9 September 2008 (diff | hist) Document Distance
- 17:57, 9 September 2008 (diff | hist) Document Distance Program Version 6 (top)
- 17:55, 9 September 2008 (diff | hist) N Document Distance Program Version 6 (cp from spring 08)
- 17:55, 9 September 2008 (diff | hist) N Document Distance Program Version 5 (cp from spring08) (top)
- 17:28, 9 September 2008 (diff | hist) Lectures and Recitations (post L01 and L02 readings)
- 18:39, 4 September 2008 (diff | hist) N Lectures and Recitations (L1 notes)
- 16:29, 4 September 2008 (diff | hist) Document Distance Program Version 4 (s/spring08/fall08/) (top)
- 16:28, 4 September 2008 (diff | hist) Document Distance Program Version 3 (s/spring08/fall08/) (top)
- 16:28, 4 September 2008 (diff | hist) Document Distance Program Version 1 (top)
- 16:27, 4 September 2008 (diff | hist) Document Distance Program Version 2 (top)
- 16:27, 4 September 2008 (diff | hist) Document Distance Program Version 1 (s/spring08/fall08/)
- 16:22, 4 September 2008 (diff | hist) Main Page
- 15:05, 4 September 2008 (diff | hist) Main Page
- 15:05, 4 September 2008 (diff | hist) Document Distance
- 15:04, 4 September 2008 (diff | hist) N Document Distance (New page: Lecture 1 topics: * Document Distance Problem Definition * Document Distance Data Sets * Document Distance Program Version 1 * Document Distance Program Version 2 * [[Docum...)
- 15:04, 4 September 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...)
- 15:03, 4 September 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 ...)
- 15:03, 4 September 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...)
- 15:03, 4 September 2008 (diff | hist) N Document Distance Program Version 1 (cp from spring 08)
- 15:03, 4 September 2008 (diff | hist) N Document Distance Data Sets (cp from spring 08) (top)
- 15:03, 4 September 2008 (diff | hist) N Document Distance Problem Definition (cp from spring 08) (top)
- 19:41, 3 September 2008 (diff | hist) N Python Cost Model (copy from spring 08) (top)
- 22:56, 9 August 2008 (diff | hist) N Python-mode for Emacs on Athena (Copying from Spring 2008) (top)
- 22:51, 9 August 2008 (diff | hist) Main Page (copy structure of Spring 2008 Main Page)
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)