Demaine - PDFSEARCH.IO - Document Search Engine

Demaine
Results: 226

#	Item
171	SP.268 Syllabus Melissa Gymrek (mgymrek), Jing Li (lijing) Supervisor: Erik Demaine (edemaine) Spring[removed]Course Description Add to Reading List Source URL: web.mit.edu Language: English - Date: 2011-02-01 22:38:51 Game theory Mathematical game Toy Mathematics
172	conceptual design maze folding algorithm [Demaine, demaine, & jason ku, 2010] crease pattern actual folding Add to Reading List Source URL: courses.csail.mit.edu - Date: 2012-08-28 11:35:35
173	6.851: Advanced Data Structures Spring 2012 Lecture 01 — Feb 7, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:41 Computer programming Data structures B-tree Persistence Persistent data structure Linked list Binary search tree Tree traversal Pointer Binary trees Graph theory Computing
174	6.851: Advanced Data Structures Spring 2012 Lecture 17 — April 24 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-15 18:17:38 Computer programming Succinct data structure Binary tree Trie Suffix tree Bit array Implicit data structure B-tree Search tree Data structures Computing Data management
175	6.851: Advanced Data Structures Spring 2012 Lecture 7 — 8 March, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Mathematics Cache Analysis of algorithms B-tree Computational complexity theory Cache-oblivious algorithm Binary search tree Heap CPU cache Theoretical computer science Binary trees Computing
176	6.851: Advanced Data Structures Spring 2012 Lecture 14 — April 10, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-22 12:47:48 Theoretical computer science Integer sorting Radix sort Bitonic sorter Merge sort Priority queue Binary logarithm Time complexity Trie Sorting algorithms Mathematics Order theory
177	6.851: Advanced Data Structures Spring 2012 Lecture 9 — March 15, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 21:33:16 Sorting algorithms Bin Merge sort Range searching Computational geometry Cache-oblivious algorithm FO Database index Mathematics Computing Theoretical computer science
178	6.851: Advanced Data Structures Spring 2012 Lecture 6 — March 6, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Combinatorics Tango tree Algorithm H tree Binary search tree Splay tree Self-balancing binary search tree B-tree Bin Binary trees Graph theory Mathematics
179	6.851: Advanced Data Structures Spring 2012 Lecture 3 — February 23, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Computer programming Point location Fractional cascading Binary search tree B-tree AVL tree Self-balancing binary search tree Tree Rope Binary trees Graph theory Computing
180	ITR: Scalable Location-Aware Monitoring (SLAM) Systems Hari Balakrishnan, Erik Demaine, Mike Stonebraker, Seth Teller Laboratory for Computer Science & Department of EECS Massachusetts Institute of Technology Cambridge, Add to Reading List Source URL: nms.lcs.mit.edu Language: English - Date: 2003-01-16 12:03:27 Radio navigation Wireless sensor network Beacon Global Positioning System Technology Navigation Wireless networking

UPDATE