Browse Dissertations and Theses - Computer Science by Title

  • Kothapalli, Krishna Harsha Reddy (2019-04-23)
    Generative adversarial nets (GANs) and variational auto-encoders enable accurate modeling of high-dimensional data distributions by forward propagating a sample drawn from a latent space. However, an often overlooked ...

    application/pdf

    application/pdfPDF (41MB)
  • Lee, Sang-Chul (2006)
    The broader impact of my work is in providing the algorithms in a form of web-enabled tools to the medical community so that medical researchers can minimize laborious and time intensive 3D volume reconstructions using the ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Harris, Mitchell Alan (2002)
    Two problems with application to the analysis and design of algorithms concerning the satisfiability of propositional formulas are investigated. With respect to the first problem, there is great experimental evidence for ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Chang, Hsien-Chih (2018-07-03)
    Any continuous deformation of closed curves on a surface can be decomposed into a finite sequence of local changes on the structure of the curves; we refer to such local operations as homotopy moves. Tightening is the ...

    application/pdf

    application/pdfPDF (4MB)
  • Zhou, Xing (2013-05-24)
    This thesis studies the techniques of tiling optimizations for stencil programs. Traditionally, research on tiling optimizations mainly focuses on tessellating tiling, atomic tiles and regular tile shapes. This thesis ...

    application/pdf

    application/pdfPDF (2MB)
  • Hsu, William Henry (1998)
    The purpose of this research is to extend the theory of uncertain reasoning over time through integrated, multi-strategy learning. Its focus is on decomposable, concept learning problems for classification of spatiotemporal ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Neves, Nuno F. (1998)
    A large number of checkpoint-based recovery protocols have been proposed in the literature, however, most of them were never evaluated. The thesis describes the design and implementation of a run-time system for clusters ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Li, Jian (1999)
    The TDT model semantics and transformations have been implemented in a tool called PUMPKIN. Using PUMPKIN a designer can analyze, apply assertions, and restructure HDL code. PUMPKIN has been used on a set of high-level ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Lamps, Jereme Matthew (2015-04-16)
    The ability to embed certain processes in virtual time is very useful to the Linux Kernel. Each process may be directed to advance in virtual time either more quickly or more slowly than actual (real) time. This allows ...

    application/pdf

    application/pdfPDF (981kB)
  • Kim, Jung-Eun (2017-04-20)
    A main mission of safety-critical cyber-physical systems is to guarantee timing correctness. The examples of safety- critical systems are avionic, automotive or medical systems in which timing violations could have disastrous ...

    application/pdf

    application/pdfPDF (2MB)
  • Dasdan, Ali (1999)
    We address the problem of timing constraint derivation and validation for reactive and real-time embedded systems. We assume that such a system is structured into its tasks, and the structure is modeled using a task graph. ...

    application/pdf

    application/pdfPDF (11MB)Restricted to U of Illinois
  • Qi, Shanxiang (2010-05-18)
    Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is ...

    application/pdf

    application/pdfPDF (951kB)
  • Nam, Min Young (2013-02-03)
    In many hard real-time avionics systems, more and more features are being added to faster but cheaper hardware. Thus, hardware resources such as computation and network bandwidth are increasingly being shared by multiple ...

    application/pdf

    application/pdfPDF (4MB)
  • Overbey, Jeffrey (2012-02-06)
    Building an automated refactoring tool for a new programming language is an expensive and time-consuming process. Usually, only a small fraction of the tool's code is devoted to refactoring transformations; most of the ...

    application/pdf

    application/pdfPDF (2MB)
  • Kamali Moghaddam, Mahsa (2012-02-01)
    Recent advancement in research and technology on virtual environments has significantly escalated users' expectations on this matter. This trend is easily witnessed, for example, by websites like twitter or facebook. ...

    application/pdf

    application/pdfPDF (6MB)
  • Hsiang, Jieh (1983)
    This thesis contains two parts, each deals with a different subject.

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Ramanan, Prakash V. (1984)
    The study of algorithm design is of fundamental importance in Computer Science. The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Vaidya, Pravin Moreshwar (1986)
    This thesis is a study of a wide variety of combinatorial optimization problems.

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Ramos, Edgar Arturo (1995)
    This thesis consists of two parts dealing with combinatorial and computational problems in geometry, respectively. In the first part three independent problems are considered: (1) We determine an upper bound $\lfloor ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Shen, Xiaojun (1989)
    This thesis studies several topics in theoretical computer science. First, the author shows that $5n-4$ is a tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois