Demaine - PDFSEARCH.IO - Document Search Engine

Demaine
Results: 226

#	Item
161	Fun with Fonts: Algorithmic Typography Erik D. Demaine and Martin L. Demaine arXiv:1404.1775v1 [cs.CG] 7 Apr[removed]MIT CSAIL, 32 Vassar St., Cambridge, MA 02139 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-04-07 20:50:22 Graphic design Typeface Univers Origami Font Fixed Type design Visual arts Typography Typesetting
162	Anchor-Free Distributed Localization in Sensor Networks Nissanka B. Priyantha, Hari Balakrishnan, Erik Demaine, and Seth Teller Tech Report #892, April 15, 2003 MIT Laboratory for Computer Science http://nms.lcs.mit.edu/ Add to Reading List Source URL: cricket.csail.mit.edu Language: English - Date: 2004-01-16 02:36:26 Combinatorics Force-based algorithms Topology Routing Unit disk graph A* search algorithm Graph theory Graph drawing Mathematics
163	Anchor-Free Distributed Localization in Sensor Networks Nissanka B. Priyantha, Hari Balakrishnan, Erik Demaine, and Seth Teller Tech Report #892, April 15, 2003 MIT Laboratory for Computer Science http://nms.lcs.mit.edu/ Add to Reading List Source URL: nms.csail.mit.edu Language: English - Date: 2004-01-16 02:36:26 Combinatorics Force-based algorithms Topology Routing Unit disk graph A* search algorithm Graph theory Graph drawing Mathematics
164	Retroactive Data Structures (extended abstract) Erik D. Demaine John Iacono Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:59 Software engineering Abstract data types Data types Persistent data structure Dynamization Priority queue Binary search tree Bin Linked list Computing Data management Data structures
165	Dynamic Optimality—Almost Erik D. Demaine∗† Dion Harmon∗ John Iacono‡† Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:32 Computer programming Splay tree Tango tree Binary search tree B-tree Rope T-tree Tree R-tree Binary trees Graph theory Data management
166	Proximate Point Searching Erik D. Demaine MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA. John Iacono Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Estimation theory Polar coordinate system Trigonometry Triangle inequality Maximum likelihood Sine Mathematics Geometry Mathematical analysis
167	Dynamic Optimality—Almost Erik D. Demaine∗† Dion Harmon∗ Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:29 Computing Splay tree Binary search tree Tango tree T-tree B-tree Tree R-tree Rope Binary trees Graph theory Data management
168	Proximate Point Searching Erik D. Demaine∗ John Iacono† Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Dimension Topology Binary trees Metric Splay tree Point location Trigonometric functions Metric space Differential geometry of surfaces Geometry Mathematics Metric geometry
169	OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗ Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Computational geometry Combinatorics Delaunay triangulation Convex hull algorithms Quicksort Convex hull Boundary Euclidean minimum spanning tree Pitteway triangulation Triangulation Geometry Mathematics
170	Grid Vertex-Unfolding Orthostacks Erik D. Demaine∗ John Iacono† Abstract Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:31 Rectangle Polyhedra Polyhedron Bin Net Geometry Polygons Quadrilaterals

UPDATE