Browse Dept. of Computer Science by Title

  • 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-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)
  • 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)
  • 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. (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)
  • Chen, Feng; Rosu, Grigore (2006-04)
    A parametric approach to control dependence is presented, where the parameter is any prefix-invariant property on paths in the control-flow graph. Existing control dependencies, both direct and indirect, can be obtained ...

    application/pdf

    application/pdfPDF (156Kb)
  • Rosu, Grigore; Chen, Feng (2008-07)
    Trace analysis plays a fundamental role in many program analysis approaches, such as runtime verification, testing, monitoring, and specification mining. Recent research efforts bring empirical evidence that execution ...

    application/pdf

    application/pdfPDF (649Kb)
  • Yang, Gung-Chung (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 compute-intensive modules: ...

    application/pdf

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Ramasamy, HariGovind Venkatraj (2005-12)
    We consider the subject of tolerance of the most severe kind of faults, namely Byzantine faults, through state machine replication in asynchronous environments such as the Internet. In Byzantine-fault-tolerant (BFT) state ...

    application/pdf

    application/pdfPDF (941Kb)
  • Padioleau, Yoann (2008-10)
    It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use of the C pre-processor (cpp), especially ifdefs and ...

    application/pdf

    application/pdfPDF (189Kb)
  • Padioleau, Yoann (2008-10)
    It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use of the C pre-processor (cpp), especially ifdefs and ...

    application/pdf

    application/pdfPDF (189Kb)