Search
Now showing items 1-10 of 505
High Performance Spatial Indexing for Parallel I/O and Centralized Architectures
(1998-10-15)
Recently, spatial databases have attracted increasing interest in the
database field. Because of the volume of the data with which they deal
with, the performance of spatial database systems' is important. The
R-tree ...
On the Early History of the Singular Value Decomposition
(1998-10-15)
This paper surveys the contributions of five
mathematicians\,---\,Eugenio Beltrami (1835--1899), Camille Jordan
(1838--1921), James Joseph Sylvester (1814--1897), Erhard Schmidt
(1876--1959), and Hermann Weyl (1885--1955 ...
Direction-of-Arrival Estimation Using the Rank-Revealing URV Decomposition
(1998-10-15)
Appeared in Proceedings of ACASSP-91.
An algorithm for updating the null space of a matrix is described.
The algorithm is based on a new decomposition, called the URV
decomposition, which can be updated in $O(N^2)$ and ...
Translating IDEF3 to PSL
(1998-11-06)
This document describes the process of integrating IDEF3
and PSL. The EPIF like frame representation developed for representing
IDEF3 schematics is introduced, together with the compilation
rules for the various IDEF3 ...
The Virtual Microscope
(1998-10-15)
We present the design of the Virtual Microscope, a software system
employing a client/server architecture to provide a realistic emulation of
a high power light microscope. We discuss several technical challenges
related ...
Optimization within a Unified Transformation Framework
(1998-10-15)
Programmers typically want to write scientific programs in a high level
language with semantics based on a sequential execution model. To execute
efficiently on a parallel machine, however, a program typically needs ...
Load Balancing for Parallel Loops in Workstation Clusters
(1998-10-15)
Load imbalance is a serious impediment to achieving good performance in
parallel processing. Global load balancing schemes are not adequately
manage to balance parallel tasks generated from a single application.
Dynamic ...
Efficient Minimum Cost Matching and Transportation Using Quadrangle Inequality
(1998-10-15)
We present efficient algorithms for finding a minimum cost perfect
matching, and for solving the transportation problem in bipartite
graphs, G=(\Red\cup \Blue, \Red\times \Blue), where |\Red|=n,
|\Blue|=m, n\le m, and the ...
Static Analysis of Upper and Lower Bounds on Dependences and Parallelism
(1998-10-15)
Existing compilers often fail to parallelize sequential code, even
when a program can be manually transformed into parallel form
by a sequence of well-understood transformations
(as is the case for many of the ...
Understanding the Sources of Variation in Software Inspections
(1998-10-15)
In a previous experiment, we determined how various changes in three
structural elements of the software inspection process (team size, and
number and sequencing of session), altered effectiveness and interval.
our results ...