Browse Dept. of Computer Science by Title

  • Seamons, Kent Eldon (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

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Belkhale, Krishna P. (1991)
    As the sizes of VLSI circuits increases in the future, the computational requirements for performing various computer-aided design (CAD) tasks will increase tremendously. In this thesis, we look at the application of ...

    application/pdf

    application/pdfPDF (6Mb)Restricted to U of Illinois
  • Amato, Nancy (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

    application/pdfPDF (5Mb)Restricted to U of Illinois
  • Chandy, John A. (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

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Konas, Pavlos (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

    application/pdfPDF (9Mb)Restricted to U of Illinois
  • Shan, Feng (2014-01-16)
    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

    application/pdfPDF (706Kb)Restricted to U of Illinois
  • Chen, Hang (2011-01-14)
    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

    application/pdfPDF (169Kb)
  • Tam, Hon Wah (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

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Evans, Graham C. (2011-05-25)
    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

    application/pdfPDF (560Kb)
  • Mueller-Thuns, Robert Bernard (1990)
    Simulation has become indispensable in the process of designing, verifying, and testing complex digital systems because it is flexible and cost-effective. As the complexity of the designs grows the time and memory requirements ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Snir, Marc (2006-07)
    The report presents the design for a new parallel programming language, PPL1. The language borrows on Java and provides a global view of data and control, while allowing user control of resource allocation and data ...

    application/pdf

    application/pdfPDF (309Kb)
  • Bocchino, Robert L., Jr.; Adve, Vikram S.; Adve, Sarita V.; Snir, Marc (2008-10)
    We examine the problem of providing a parallel programming model that guarantees deterministic semantics. We propose a research agenda focusing on the following questions: 1. How to guarantee determinism in a modern ...

    application/pdf

    application/pdfPDF (73Kb)
  • Bocchino, Robert L., Jr.; Adve, Vikram S.; Adve, Sarita V.; Snir, Marc (2008-11)
    We examine the problem of providing a parallel programming model that guarantees deterministic semantics. We propose a research agenda focusing on the following questions: 1. How to guarantee determinism in a modern ...

    application/pdf

    application/pdfPDF (73Kb)
  • Bikshandi, Ganesh (2007-01)
    Writing high performance programs is a non-trivial task and remains a challenge even to advanced programmers. This dissertation describes a new data type, Hierarchically Tiled Array (HTA), that simplifies this task. HTAs ...

    application/pdf

    application/pdfPDF (2Mb)
  • Choi, Byn; Komuravelli, Rakesh; Lu, Victor; Sung, Hyojin; Bocchino, Robert L., Jr. (2009-09-22)
    The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations between rays and the primitives. The highest ...

    application/pdf

    application/pdfPDF (1Mb)
  • Bhasin, Rajesh (2011-08-25)
    We propose a fast parallel algorithm for reconstruction of 3-Dimensional point clouds of insects from binocular stereo image pairs using a hierarchical approach for disparity estimation.When considering the large collections ...

    application/pdf

    application/pdfPDF (1Mb)
  • application/pdf

    application/pdfPDF (2Mb)Restricted to U of Illinois
  • Kraska, Paul William (1972)

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Gupta, Abhishek; Heumann, Stephen; Krejcie, Alex (2010-10-31)
    This paper addresses the problem of Automated Video Surveillance (AVS), which involves automatically analyzing surveillance videos to detect suspicious or otherwise interesting activity. Interest in AVS is rapidly growing ...

    application/pdf

    application/pdfPDF (352Kb)
  • Chen, Feng; Rosu, Grigore (2007-01)
    Happen-before causal partial order relations have been widely used in concurrent program verification and testing. In this paper, we present a parametric approach to happen-before causal partial orders. All existing variants ...

    application/pdf

    application/pdfPDF (130Kb)