Browse Dept. of Computer Science by Title

  • Cao, Qing (2008-10)
    Wireless sensor networks promise an unprecedented potential for observing the physical world. Their battery life, however, is usually the bottleneck that limits application lifetime, a problem that is exacerbated by the ...

    application/pdf

    application/pdfPDF (3MB)
  • Cao, Qing (2008-10)
    Wireless sensor networks promise an unprecedented potential for observing the physical world. Their battery life, however, is usually the bottleneck that limits application lifetime, a problem that is exacerbated by the ...

    application/pdf

    application/pdfPDF (3MB)
  • Cao, Qing (2008)
    Because these three problems are closely related to the role played by energy, we call the overall LiteArch architecture energy-centric. The immediate implications of LiteArch is that it can improve the performance of the ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Wang, Jun (2003)
    Traffic engineering (TE) is crucial in hop-by-hop OSPF networks. We present a novel, edge-based traffic engineering method to approximate the optimal traffic allocation. The new method uses bandwidth-sensitive hop-by-hop ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Kale, Vivek (2011-01-14)
    Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors (now cores). However, these strategies often do ...

    application/pdf

    application/pdfPDF (629kB)
  • Tuomenoska, Mark Logan (1983)
    In 1974, Dennis Ritchie and Ken Thompson published their now famous paper The UNIX1 Time-Sharing System in Communications of the ACr..L In 1978, approximately 1000 computers ran the UNIX system world wide. By 1982 this ...

    application/pdf

    application/pdfPDF (24MB)Restricted to U of Illinois
  • Yang, Hongseok (2001)
    Programs are called stateful when they manipulate the state of a computer explicitly, for example, by assignment. The main theme of the thesis is reasoning about stateful programs. In fact, for the past 30 years, significant ...

    application/pdf

    application/pdfPDF (11MB)Restricted to U of Illinois
  • Lazebnik, Svetlana (2006)
    This dissertation addresses the problems of recognizing textures, objects, and scenes in photographs. We present approaches to these recognition tasks that combine salient local image features with spatial relations and ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Lazebnik, Svetlana (2006-04)
    This dissertation addresses the problems of recognizing textures, objects, and scenes in photographs. We present approaches to these recognition tasks that combine salient local image features with spatial relations and ...

    application/pdf

    application/pdfPDF (19MB)
  • Sundresh, Sameer; Kwon, YoungMin; Mechitov, Kirill; Kim, Wooyoung; Agha, Gul A. (2005-03)
    Localization is the process by which sensor networks associate spatial position information with individual sensors' measurements. While manual surveying is sufficient for small-scale prototypes, it is too time-consuming ...

    application/pdf

    application/pdfPDF (111kB)
  • Li, Ning (2005)
    Finally, we consider power-efficient broadcast in wireless ad hoc networks as an application of the proposed topology control algorithms, and propose Broadcast on Local Spanning Subgraph (BLSS), which broadcasts in a ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Li, Ning (2005-08)
    Topology control has crucial impact on the system performance of wireless ad hoc networks. We propose several topology control algorithms that can maintain network connectivity while reducing energy consumption and improving ...

    application/pdf

    application/pdfPDF (1MB)
  • Schuster, Stewart Arnold (1973)

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Pan, Peichen (1995)
    Computer-aided design of VLSI circuits is usually carried out in three synthesis steps: high-level synthesis, logic synthesis and layout synthesis. Each synthesis step is further broken into a few optimization problems. ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Hu, Jackson Kwo-Chain (1978)

    application/pdf

    application/pdfPDF (10MB)Restricted to U of Illinois
  • Limqueco, Johnson Chan (1992)
    The logic networks that can be put on a single chip continues to grow in size and complexity. There is thus an increasing need for designers to rely on the assistance of computer-aided design tools to provide a fast design ...

    application/pdf

    application/pdfPDF (12MB)Restricted to U of Illinois
  • Chen, Kuang-Chien (1991)
    As VLSI integration size and chip complexity keep increasing, logic design is becoming more complex and it must be automated. The increasing demand for ASIC (Application Specific Integrated Circuits) also needs design ...

    application/pdf

    application/pdfPDF (11MB)Restricted to U of Illinois
  • Hsieh, Chang-Chao (1998)
    In the optimization phase, the Transduction method and the delay-reducing/delay-restricted Transduction method are employed to minimize the area or delay of the already rectified network. Compatible sets of permissible ...

    application/pdf

    application/pdfPDF (9MB)Restricted to U of Illinois
  • Renner, Scott Alexander (1990)
    There are almost always differences between the behavior intended by a programmer and the behavior actually implemented by his code. These differences are logical errors. The process of locating the cause of these differences ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Amir, Eyal; Russell, Stuart (2005-05)
    Filtering denotes any method whereby an agent updates its belief state - its knowledge of the state of the world - from a sequence of actions and observations. In logical filtering, the belief state is a logical formula ...

    application/pdf

    application/pdfPDF (325kB)