Browse Dept. of Computer Science by Title

  • Yang, Der-Shung (1994)
    Computer-Aided Design and Drafting (CADD) systems have become prevalent for producing building design drawings. An ultimate goal of CADD systems is to automate analyses and communication of high-level design information ...

    application/pdf

    application/pdfPDF (10MB)Restricted to U of Illinois
  • Biehl, Jacob T. (2004-01)
    By enabling users to better manage information across PDAs, laptops, graphics tablets, and large screens, the use of an interactive space could dramatically improve how users share information in collaborative work. To ...

    application/pdf

    application/pdfPDF (415kB)
  • Chakrabarti, Kaushik (2001)
    To handle the huge data volumes and fast response time requirements in decision support applications, we develop an approximate query processing technique based on multidimensional wavelets. Our technique constructs compact ...

    application/pdf

    application/pdfPDF (12MB)Restricted to U of Illinois
  • Huang, Michael Cliff (2002)
    The second part of the thesis discusses how to further improve the algorithm for energy efficiency. We observe that applications change their demands on the hardware as they execute. This suggests that certain hardware ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Smith, Kenneth Paul (1992)
    Traditional databases are viewed as passive repositories of data. We store, retrieve, and alter data in a database, but do not expect a database to respond to actions performed to it. This passive paradigm is now rapidly ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Lin, Ruei-Sung (2006)
    We apply our manifold learning algorithm to synthetic data and real world applications. The experiment on synthetic data clearly demonstrates that by taking temporal dependency among global coordinates into consideration ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Lin, Ruei-Sung (2006-05)
    This thesis addresses the problem of learning manifold from time series. We use the mixtures of probabilistic principal component analyzers (MPPCA) to model the nonliner manifold. In addition, we extend the MPPCA model by ...

    application/pdf

    application/pdfPDF (6MB)
  • Tovar, Benjamin; Freda, Luigi; LaValle, Steven M. (2006-08)
    This paper considers a robot that moves in the plane and is only able to sense the cyclic order of landmarks with respect to its current position. No metric information (e.g., coordinates) is available regarding the robot ...

    application/pdf

    application/pdfPDF (244kB)
  • Yershova, Anna; Tovar, Benjamin; Ghrist, Robert; LaValle, Steven M. (2009-04-16)
    This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse the interior of the environment only when ...

    application/pdf

    application/pdfPDF (274kB)
  • Vu, Long; Gupta, Indranil; Liang, Jin; Nahrstedt, Klara (2006-08)
    While several deployed p2p file sharing overlays have been characterized in the literature, this paper shows that some of their conclusions may be false for p2p applications that stream media instead. Specifically, we ...

    application/pdf

    application/pdfPDF (330kB)
  • Chen, Kai; Yang, Zhenyu; Wagener, Christian; Nahrstedt, Klara (2005-01)
    Multihop wireless hotspot network has been recently proposed to extend the coverage area of a base station. However, with selfish nodes in the network, multihop packet forwarding cannot take place without an incentive ...

    application/pdf

    application/pdfPDF (160kB)
  • Ham, MyungJoo (2009)
    We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Rosu, Grigore; Schulte, Wolfram (2009-01)
    Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

    application/pdf

    application/pdfPDF (477kB)
  • Rosu, Grigore; Schulte, Wolfram (2009-01)
    Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

    application/pdf

    application/pdfPDF (477kB)
  • Rosu, Grigore (2011-11-16)
    Matching logic allows to specify structural properties about program configurations by means of special formulae, called patterns, and to reason about them by means of pattern matching. This paper proposes rewriting ...

    application/pdf

    application/pdfPDF (285kB)
  • Rosu, Grigore (2014-01-20)
    Matching logic is a first-order logic (FOL) variant to reason about structure. Its sentences, called patterns, are constructed using variables, symbols, connectives and quantifiers, but no dif ference is made between ...

    application/pdf

    application/pdfPDF (232kB)
  • Yu, Tian-Li (2006)
    Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Yu, Tian-Li (2006-11)
    Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

    application/pdf

    application/pdfPDF (2MB)
  • Frazier, Michael Duane (1994)
    Current knowledge representation research has sought to provide schemes for encoding knowledge about how a given system behaves, with the goal being accuracy and utility. Ideally, the goal of encoding knowledge is not the ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Cholewa, Andrew Russel (2015-04-28)
    Maude-NPA is a narrowing-based model checker for analysing cryptographic protocols in the Dolev-Yao model modulo equations. Maude-NPA is a powerful analyzer that is sound and never returns spurious counter-examples. ...

    application/pdf

    application/pdfPDF (801kB)