Use of the singular value decomposition to increase execution and storage efficiency of the Manteuffel algorithm for the solution of nonsymmetric linear systems /

Bibliography: p. 17-18.

A semi-virtual memory multi-programming system for the mini-computer PDP 8/3 (ILLIAC-3) /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

A simulation study of a disk storage allocations system.

Includes bibliographical references.

Analysis of computer architectures for information retrieval /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Charge analysis predictions and measurements of storage time for a switching transistor.

Thesis (M.S.)--University of Illinois.

Dynamic partitioning in the array language OL/2 /

"January, 1971."

An analysis of rotational storage access scheduling in a multiprogrammed information retrieval system /

Thesis--University of Illinois at Urbana-Champaign.

WALSHSTORE : the application of burst processing to fail-soft storage systems using Walsh transforms /

"UILU-ENG 77 1753."

An iterative method for solving nonsymmetric linear systems with dynamic estimation of parameters /

Vita.

Separate carry storage adders /

"March 7, 1960"

A study of parallel one's complement arithmetic units with separate carry or borrow storage /

Vita.

A specialized computer for information retrieval /

Originally presented as the author's thesis, University of Illinois at Urbana-Champaign, 1974.

The DCS information storage and retrieval system for graduate applicants and students /

Mode of access: Internet.

Alphechon : evaluation of a developmental video storage tube /

COO 1469-0197.

An adaptive and dynamic dimensionality reduction method for high-dimensional indexing

The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approach to overcome degradation in performance with respect to increasing dimensions is to reduce the dimensionality of the original dataset before constructing the index. However, identifying the correlation among the dimensions and effectively reducing them are challenging tasks. In this paper, we present an adaptive Multi-level Mahalanobis-based Dimensionality Reduction (MMDR) technique for high-dimensional indexing. Our MMDR technique has four notable features compared to existing methods. First, it discovers elliptical clusters for more effective dimensionality reduction by using only the low-dimensional subspaces. Second, data points in the different axis systems are indexed using a single B+-tree. Third, our technique is highly scalable in terms of data size and dimension. Finally, it is also dynamic and adaptive to insertions. An extensive performance study was conducted using both real and synthetic datasets, and the results show that our technique not only achieves higher precision, but also enables queries to be processed efficiently. Copyright Springer-Verlag 2005