Lars Arge - PDFSEARCH.IO - Document Search Engine

Lars Arge
Results: 19

#	Item
1	Cleaning Massive Sonar Point Clouds Lars Arge∗ Kasper Green Larsen∗ Aarhus University Add to Reading List Source URL: users.cs.duke.edu - Date: 2015-07-24 06:57:56
2	I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:53 Graph theory Eulerian path Matching Spanning tree Graph coloring NP-complete problems
3	Thomas Mølhave (Moelhave) SCALGO AabogadeAarhus N Denmark Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 07:08:16 Computer science Lars Arge European Symposium on Algorithms Computational geometry Symposium on Computational Geometry Symposium on Principles of Database Systems Empirical algorithmics
4	Scalable Algorithms for Large High-Resolution Terrain Data ∗ Thomas Mølhave Pankaj K. Agarwal Lars Arge Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:57 Geographic information systems Geography Physical geography Digital elevation models Earth Hydrology Shuttle Radar Topography Mission Synthetic aperture radar Terrain Lidar Flood Advanced Spaceborne Thermal Emission and Reflection Radiometer
5	PC CHAIRS REPORT János Pach & Lars Arge SOCG June 24, 2015 Add to Reading List Source URL: www.computational-geometry.org Language: English - Date: 2015-06-26 05:15:07 Academic conferences Academic publishing Abstract management Conferences Digital media Research EasyChair Pach LaTeX Electronic submission
6	I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff Add to Reading List Source URL: www.cs.swarthmore.edu Language: English - Date: 2004-01-23 10:39:23 Graph theory Data management Computing R-tree Persistent data structure FO B+ tree Tango tree B-tree Binary trees Data structures
7	Computing Pfafstetter Labelings I/O-Efficiently (abstract) Lars Arge∗ Andrew Danner† Add to Reading List Source URL: www.cs.swarthmore.edu Language: English - Date: 2006-01-17 14:17:20
8	Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge† Add to Reading List Source URL: www.cs.swarthmore.edu Language: English - Date: 2003-09-17 11:15:54 Cache Computer science Cache-oblivious algorithm K-d tree Binary logarithm Computational geometry Range tree Fast Fourier transform Bin Mathematics Computing Analysis of algorithms
9	Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs Lars Arge MADALGO Aarhus University Add to Reading List Source URL: www.vanwal.dk - Date: 2013-01-21 07:47:33
10	I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrains Models Lars Arge?1 , Andrew Danner??2 , Herman Haverkort???3 , and Norbert Zeh†4 1 Department of Computer Science, University of Aarhus, Aarhus, Denm Add to Reading List Source URL: www.cs.swarthmore.edu - Date: 2006-03-10 11:29:18