Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Algorithms and Data Structures for External Memory
  • Language: en
  • Pages: 192

Algorithms and Data Structures for External Memory

Describes several useful paradigms for the design and implementation of efficient external memory (EM) algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing.

External Memory Algorithms
  • Language: en
  • Pages: 330

External Memory Algorithms

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.

Algorithms for Parallel Memory
  • Language: en

Algorithms for Parallel Memory

  • Type: Book
  • -
  • Published: 1990
  • -
  • Publisher: Unknown

None

New Methods for Lossless Image Compression Using Arithmetic Coding
  • Language: en
  • Pages: 23

New Methods for Lossless Image Compression Using Arithmetic Coding

  • Type: Book
  • -
  • Published: 1991
  • -
  • Publisher: Unknown

We express our results both in terms of a useful new measure of compression efficiency, which we call compression gain."

The Design and Analysis of Coalesced Hashing
  • Language: en
  • Pages: 182

The Design and Analysis of Coalesced Hashing

Hashing, a commonly used technique for arranging data to facilitate rapid searches, is discussed from several different perspectives as an efficient solution to the classical problem of information storage and retrieval. The underlying theme is close cooperation between the analysis of algorithms and the computer world. To increase the work's accessibility to computer scientists, algorithms are given both in English and in a variant of the well-known language Pascal. Designed to appeal to as wide an audience as possible, this book serves both as a graduate text in analysis of algorithms and as a professional reference for computer scientists and programmers.

Research in Progress
  • Language: en
  • Pages: 302

Research in Progress

  • Type: Book
  • -
  • Published: 1992
  • -
  • Publisher: Unknown

None

Efficient Algorithms for MPEG Video Compression
  • Language: en
  • Pages: 208

Efficient Algorithms for MPEG Video Compression

Video compression is the enabling technology behind many cutting-edge business and Internet applications, including video-conferencing, video-on-demand, and digital cable TV. Coauthored by internationally recognized authorities on the subject, this book takes a close look at the essential tools of video compression, exploring some of the most promising algorithms for converting raw data to a compressed form.

External Memory Algorithms
  • Language: en
  • Pages: 321

External Memory Algorithms

The algorithms involve using techniques from computer science and mathematics to solve combinatorial problems whose associated data require the use of a hierarchy of storage devices. The 15 papers discuss such topics as synopsis data structures for massive data sets, maximum clique problems in very large graphs, concrete software libraries, computing on data streams, efficient cross-trees for external memory, efficient schemes for distributing data on parallel memory systems, and external memory techniques for iso-surface extraction in scientific visualization. Annotation copyrighted by Book News, Inc., Portland, OR.

The Shortest Path Problem
  • Language: en
  • Pages: 337

The Shortest Path Problem

None

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges
  • Language: en
  • Pages: 272

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges

The 11 papers are from two workshops: one in 1995-95 on dictionaries and priority queues, and the other in 1998-99 on near neighbor searches, the fifth and sixth DIMACS Algorithm Implementation Challenges initiated in 1991. They address those challenges with considerations of a practical perfect hashing algorithm, locally lifting the curse of dimensionality for a nearest neighbor search, and other topics. They also discuss methodology for the experimental analysis of algorithms. They are not indexed. Annotation copyrighted by Book News, Inc., Portland, OR.