External memory algorithms and data structures: Dealing with massive data
JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
High-throughput DNA sequence data compression
The exponential growth of high-throughput DNA sequence data has posed great challenges
to genomic data storage, retrieval and transmission. Compression is a critical tool to address …
to genomic data storage, retrieval and transmission. Compression is a critical tool to address …
FAB-MAP: Probabilistic localization and map** in the space of appearance
This paper describes a probabilistic approach to the problem of recognizing places based
on their appearance. The system we present is not limited to localization, but can determine …
on their appearance. The system we present is not limited to localization, but can determine …
[書籍][B] Algorithms and data structures: The basic toolbox
K Mehlhorn, P Sanders, P Sanders - 2008 - Springer
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …
modern and active area of computer science. Every computer scientist and every …
Algorithms and data structures for external memory
JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
Probabilistic appearance based navigation and loop closing
This paper describes a probabilistic framework for navigation using only appearance data.
By learning a generative model of appearance, we can compute not only the similarity of two …
By learning a generative model of appearance, we can compute not only the similarity of two …
[書籍][B] Sequential and Parallel Algorithms and Data Structures
viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …
proportional performance improvements from increased circuit complexity. Although the …
STXXL: standard template library for XXL data sets
R Dementiev, L Kettner… - Software: Practice and …, 2008 - Wiley Online Library
We present the software library Stxxl that is an implementation of the C++ standard template
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …
Index-based optimal algorithms for computing steiner components with maximum connectivity
With the proliferation of graph applications, the problem of efficiently computing all k-edge
connected components of a graph G for a user-given k has been recently investigated. In …
connected components of a graph G for a user-given k has been recently investigated. In …
Algorithm engineering–an attempt at a definition
P Sanders - Efficient Algorithms: Essays Dedicated to Kurt …, 2009 - Springer
This paper defines algorithm engineering as a general methodology for algorithmic
research. The main process in this methodology is a cycle consisting of algorithm design …
research. The main process in this methodology is a cycle consisting of algorithm design …