Catalogue


External memory algorithms : DIMACS Workshop External Memory Algorithms and Visualization, May 20-22, 1998 /
James M. Abello, Jeffrey Scott Vitter, editors.
imprint
Providence, RI : American Mathematical Society, c1999.
description
xi, 306 p. : ill.
ISBN
0821811843 (alk. paper)
format(s)
Book
Holdings
A Look Inside
Reviews
This item was reviewed in:
SciTech Book News, March 2000
To find out how to look for other reviews, please see our guides to finding book reviews in the Sciences or Social Sciences and Humanities.
Summaries
Long Description
This volume presents new research results and current techniques for the design and analysis of external memory algorithms. Topics presented include problems in computational geometry, graph theory, data compression, disk scheduling, linear algebra, statistics, software libraries, text and string processing, visualization, wavelets, and industrial applications.
Table of Contents
External memory algorithms and data structures
Synopsis data structures for massive data sets
Calculating robust depth measures for large data sets
Efficient cross-trees for external memory
Computing on data streams
On maximum clique problems in very large graphs
I/O-optimal computation of segment intersections
On showing lower bounds for external-memory computational geometry problems
A survey of out-of-core algorithms in numerical linear algebra
Concrete software libraries
S(b)-tree library: An efficient way of indexing data
ASP: Adaptive online parallel disk scheduling
Efficient schemes for distributing data on parallel memory systems
External memory techniques for isosurface extraction in scientific visualization
R-tree retrieval of unstructured volume data for visualization
Table of Contents provided by Publisher. All Rights Reserved.

This information is provided by a service that aggregates data from review sources and other sources that are often consulted by libraries, and readers. The University does not edit this information and merely includes it as a convenience for users. It does not warrant that reviews are accurate. As with any review users should approach reviews critically and where deemed necessary should consult multiple review sources. Any concerns or questions about particular reviews should be directed to the reviewer and/or publisher.

  link to old catalogue

Report a problem