 IDEALS Home
 →
 College of Engineering
 →
 Dept. of Computer Science
 →
 Dissertations and Theses  Computer Science
 →
 Browse Dissertations and Theses  Computer Science by Title
Browse Dissertations and Theses  Computer Science by Title
Now showing items 969988 of 1504

(1983)A number of applications exist for systems which can store and interactively retrieve from very large natural language textual databases. This thesis discusses conventional approaches to the design of such systems. The ...
application/pdf
PDF (6MB) 
(20110525)In this thesis, we describe two related memory allocators, each with novel properties. PALLOC1 contributes a unique strategy based on the traversal of a parallel tree data structure for allowing concurrent allocations and ...
application/pdf
PDF (737kB) 
Panda: Fast access to persistent arrays using highlevel interfaces and server directed input/output (1996)Multidimensional arrays are a fundamental data type in scientific computing and are used extensively across a broad range of applications. Often these arrays are persistent, i.e., they outlive the invocation of the program ...
application/pdf
PDF (7MB) 
(1991)As the sizes of VLSI circuits increases in the future, the computational requirements for performing various computeraided design (CAD) tasks will increase tremendously. In this thesis, we look at the application of ...
application/pdf
PDF (6MB) 
(1995)Computational geometry is concerned with the algorithmic aspects of solving geometric problems. The problems are motivated from and have application to such diverse areas as computer graphics, robotics, computer vision, ...
application/pdf
PDF (5MB) 
(1996)As modern VLSI designs have become larger and more complicated, the computational requirements for design automation tools have also increased. As a result, the parallelization of these tools is of great importance. One ...
application/pdf
PDF (4MB) 
(20150717)We develop scalable algorithms for twostage stochastic program optimizations. We propose performance optimizations such as cutwindow mechanism in Stage 1 and scenario clustering in Stage 2 of benders method for solving ...
application/pdf
PDF (5MB) 
(1997)We finally settled on a partitioning based approach to parallelization. This technique gives us acceptable speedups, if the partitioning and placement of partitions on processors is done carefully. Partitioning and placement ...
application/pdf
PDF (5MB) 
(1994)The ever increasing size and complexity of computer systems made possible by the rapid advances in VLSI technology and computer architecture, have resulted in simulations which require excessive amounts of processing power ...
application/pdf
PDF (9MB) 
(20140116)Data analysis is receiving considerable attention with the design of new graphics processing units (GPUs). Our study focuses on geostatistical data analysis, which is currently applied in diverse disciplines such as ...
application/pdf
PDF (706kB) 
(2002)A tetrahedron is acute if all its dihedral angles are less than 90°. Triangulations of threedimensional domains with acute tetrahedra are useful in mesh generation. We give several constructions for tiling space with ...
application/pdf
PDF (6MB) 
(20110114)Probabilistic Latent Semantic Analysis (PLSA) has been successfully applied to many text mining tasks such as retrieval, clustering, summarization, etc. PLSA involves iterative computation for a large number of parameters ...
application/pdf
PDF (169kB) 
(1989)We study time parallelism for the numerical solution of nonstiff ordinary differential equations. Stability and accuracy are the two main considerations in deriving good numerical o.d.e. methods. However, existing parallel ...
application/pdf
PDF (4MB) 
(20110525)Solving linear systems is an important problem for scientific computing. Exploiting parallelism is essential for solving complex systems, and this traditionally involves writing parallel algorithms on top of a library such ...
application/pdf
PDF (560kB) 
(1990)Simulation has become indispensable in the process of designing, verifying, and testing complex digital systems because it is flexible and costeffective. As the complexity of the designs grows the time and memory requirements ...
application/pdf
PDF (4MB) 
(2007)To prove these claims, two popular languages, C++ and MATLAB, have been extended with HTA. In addition, the NAS benchmark suite, a set of complex computation intensive parallel programs, have been rewritten using HTAs. ...
application/pdf
PDF (5MB) 
(20110825)We propose a fast parallel algorithm for reconstruction of 3Dimensional point clouds of insects from binocular stereo image pairs using a hierarchical approach for disparity estimation.When considering the large collections ...
application/pdf
PDF (1MB) 
application/pdf
PDF (2MB) 
application/pdf
PDF (4MB) 
(1990)A general approach to parallelizing direct method circuit simulation has been developed via novel algorithms. The approach extracts parallel tasks at the algorithmic level for the three most computeintensive modules: ...
application/pdf
PDF (7MB)
Now showing items 969988 of 1504