Results 1 to 10 of about 1,205,838 (231)
RAM-Efficient External Memory Sorting [PDF]
Algorithmica, 2013 In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os).
A. Aggarwal +4 more
core +7 more sources
Lempel-Ziv Parsing in External Memory [PDF]
2014 Data Compression Conference, 2013 For decades, computing the LZ factorization (or LZ77 parsing) of a string has been a requisite and computationally intensive step in many diverse applications, including text indexing and data compression.
Kempa, Dominik +2 more
core +3 more sources
Bidirectional Text Compression in External Memory [PDF]
, 2019 Bidirectional compression algorithms work by substituting repeated substrings by references that, unlike in the famous LZ77-scheme, can point to either direction.
+4 more
core +5 more sources
External-Memory Multimaps [PDF]
Algorithmica, 2011 Accepted to ISAAC 2011.
Justin Thaler +3 more
openaire +4 more sources
External-memory computational geometry [PDF]
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 2002 In this paper we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory. We use these techniques to develop optimal and practical algorithms for a number of important large-scale problems.
Goodrich, Michael T. +3 more
openaire +3 more sources
A Bulk-Parallel Priority Queue in External Memory with STXXL [PDF]
, 2015 We propose the design and an implementation of a bulk-parallel external memory priority queue to take advantage of both shared-memory parallelism and high external memory transfer speeds to parallel disks. To achieve higher performance by decoupling item
GS Brodal +9 more
core +3 more sources
Optimal Hashing in External Memory [PDF]
, 2018 Hash tables are a ubiquitous class of dictionary data structures. However, standard hash table implementations do not translate well into the external memory model, because they do not incorporate locality for insertions. Iacono and Patracsu established an update/query tradeoff curve for external hash tables: a hash table that performs insertions in $O(
Conway, Alex +2 more
openaire +4 more sources
Computing visibility on terrains in external memory [PDF]
ACM Journal of Experimental Algorithmics, 2007 Given an arbitrary viewpoint v and a terrain, the visibility map or viewshed of v is the set of points in the terrain that are visible from v . In this article we consider the problem of computing the viewshed of a point on a very large grid terrain in external memory.
Herman Haverkort, Laura Toma, Yi Zhuang
openaire +3 more sources
An Edge Quadtree for External Memory [PDF]
, 2013 We consider the problem of building a quadtree subdivision for a set E of n non-intersecting edges in the plane. Our approach is to first build a quadtree on the vertices corresponding to the endpoints of the edges, and then compute the intersections between E and the cells in the subdivision.
Herman Haverkort +2 more
openaire +2 more sources
Is external memory memory? Biological memory and extended mind [PDF]
Consciousness and Cognition, 2012 Clark and Chalmers (1998) claim that an external resource satisfying the following criteria counts as a memory: (1) the agent has constant access to the resource; (2) the information in the resource is directly available; (3) retrieved information is automatically endorsed; (4) information is stored as a consequence of past endorsement.
openaire +5 more sources