# Browse by Subject "Computer Science"

• (1990)
Previous efforts to integrate Explanation-Based Learning (EBL) and Similarity-Based Learning (SBL) have treated these two methods as distinct interactive processes. In contrast, the synthesis presented here views these ...

application/pdf

PDF (5MB)
• (1983)
The desirability and suitability of using very large arrays of processors such as the Massively Parallel Processor (MPP) for processing remotely sensed images is investigated. The dissertation can be broken into two areas.

application/pdf

PDF (3MB)
• (2003)
This thesis explores the use of Parzen windows for modeling image data. The validity of such a model is shown to follow naturally from the elementary Gestalt laws of vicinity, similarity, and continuity of direction. ...

application/pdf

PDF (9MB)
• (1997)
Each of the three feature sets, color, morphology, and texture were able to discriminate specific seeds with varying degrees of success. A neuro-fuzzy inference system was developed to classify asymptomatic, Cercospora ...

application/pdf

PDF (12MB)
• (2007)
The second proposed method aims to model small-scale geometry of volumetric surface materials with complex reflectance. Instead of recovering the intricate geometry itself, it uses an appearance-based approach of volumetric ...

application/pdf

PDF (4MB)
• (1988)
The goal of this work has been to better understand analytical atomic emission sources. Heavy reliance on engineering designs of predecessors is exhibited, with the exception of charge coupled device (CCD) detection ...

application/pdf

PDF (12MB)
• (1997)
The general conclusion of this study is that the benefits of electronic commerce to consumers (primarily reduction of search costs and prices), and organizations (reduction of market interface and production costs, expansion ...

application/pdf

PDF (7MB)
• (1978)

application/pdf

PDF (3MB)
• (1996)
Imperative and functional programming are two styles which have long been viewed as incompatible. In particular, the functional property of referential transparency could not be maintained in the face of destructive update, ...

application/pdf

PDF (7MB)
• (1989)
Rewrite systems are directed equations that can be used to compute by repeatedly rewriting an initial term until a final form is obtained. Such systems provide a nondeterministic programming language having convenient ...

application/pdf

PDF (5MB)
• (1997)
This thesis presents a model for the implementation of run-time systems. We divide the implementation of the run-time system in 3 sub-tasks: implementing the data types, implementing the environment, and implementing the ...

application/pdf

PDF (10MB)
• (2005)
We demonstrate an interactive parallel rendering system based on the impostors technique. Impostors increase the latency tolerance of an interactive rendering system, which allows us to use the power of a parallel machine ...

application/pdf

PDF (4MB)
• (1996)
The thesis is concerned with the behavior of corrupted real-time control systems and their corrupted trajectories. The difference between the corrupted trajectory and the precise trajectory is called the tracking error. ...

application/pdf

PDF (3MB)
• (1993)
As the size of modern VLSI circuits increases, new problems are emerging in the VLSI CAD area. The circuit is becoming more difficult to test, the circuit performances are greatly influenced by the physical layout, and the ...

application/pdf

PDF (4MB)
• (1991)
Search is ubiquitous in computer science, but most searches are performed under constraints: time, memory, dependences. We study several cases of constrained search and present methods for improving their performance. ...

application/pdf

PDF (6MB)
• (2002)
Alternatively, the memory can directly execute memory-intensive code sections. We propose a compiler and run-time algorithm to break out the code into sections with uniform memory and compute behavior. These sections are ...

application/pdf

PDF (5MB)
• (1977)

application/pdf

PDF (4MB)
• (1994)
A new family of preconditioners for conjugate gradient-like iterative methods applied to large sparse linear least squares problems, $min\Vert Ax-b\Vert\sb2$, is proposed. The family is based on incomplete Gram-Schmidt ...

application/pdf

PDF (10MB)
• (1996)
An integrated teaching system was developed and tested on students enrolled in a woody landscape plants identification course. A Microsoft Windows-based system incorporated high quality digital images and text in an ...

application/pdf

PDF (5MB)
• (1994)
General Purpose Layout System (GPLS) is proposed as a bidirectional layout conversion system. GPLS can translate layout to stick diagram, stick diagram to layout, layout to layout, mixed input to layout. To achieve these ...

application/pdf

PDF (7MB)