# Browse Dept. of Computer Science by Title

• (1998)
This thesis outlines a way of addressing the goal of precise interprocedural analysis, based on a combination of techniques: for representing memory accesses within interprocedural. sections of code, for summarizing ...

application/pdf

PDF (6MB)
• (1976)

application/pdf

PDF (4MB)
• (2015-06-02)
The revolutionary technological and regulatory changes in financial markets over the first few years of the new millennium have radically altered trading routines and strategies. Algorithms have taken over trade executions ...

application/pdf

PDF (7MB)
• (1989)
A parallelizing compiler relies on data dependence analysis to detect independent operations in a user's program. In scientific and engineering programs, it is important for the compiler to analyze data dependences involving ...

application/pdf

PDF (5MB)
• (1996)
Much attention over the past ten years has been given to the research field of Computer-Supported Cooperative Work (CSCW). Although a relatively young research domain, CSCW includes a large, multi-disciplinary research ...

application/pdf

PDF (9MB)
• (2015-03-10)
From a single picture of a scene, people can typically grasp the spatial layout immediately and even make good guesses at materials properties and where light is coming from to illuminate the scene. For example, we can ...

application/pdf

PDF (144MB)
• (2017-07-09)
Many students underperform on exams due to experiencing high test anxiety. In this dissertation, I present three studies examining how test anxiety affects students taking open-ended computer programming exams and methods ...

application/pdf

PDF (4MB)
• (1976)

application/pdf

PDF (4MB)
• (2007-12)
Data aggregation is an efficient mechanism widely used in wireless sensor networks (WSN) to collect statistics about data of interests. However, the shared-medium nature of communication makes the WSNs are vulnerable to ...

application/pdf

PDF (200kB)
• (2004-05)
Traditional TV production systems monitor multiple perspectives of human activities and interests, but hide the source streams by providing all viewers with the same final video program. This approach leaves huge amount ...

application/pdf

PDF (2MB)
• (2005-04)
Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintaining $k$-coverage depends on the area of the ...

application/pdf

PDF (198kB)
• (2010)
This is a browsable html document presenting an Isabelle formalization of a general theory of syntax with static bindings and substitution.

application/zip

ZIP (3MB)
• (2010)
This document presents and Isabelle formalization of a general theory of syntax with bindings. It also includes some case studies from the theory of lambda-calculus.

application/zip

ZIP (2MB)
• (2010-01-28)

application/zip

ZIP (772kB)
• (2018-06-25)
K (Roşu and Şerbănuţă, 2010) is a rewrite-based executable semantic framework in which programming languages, type systems and formal analysis tools can be de ned using con gurations, computations and rules. In this paper ...

application/pdf

PDF (724kB)
• (2009-03)
This paper presents an Incentive-based Sharing (iShare) protocol that blends cellular and ad hoc networks for content dissemination services. With iShare, mobile users download content from a source via cellular links and ...

application/pdf

PDF (312kB)
• (2009-03)
This paper presents an Incentive-based Sharing (iShare) protocol that blends cellular and ad hoc networks for content dissemination services. With iShare, mobile users download content from a source via cellular links and ...

application/pdf

PDF (312kB)
• (Urbana, Ill. : Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1969)

application/pdf

PDF (7MB)
• (2006-07)
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing, including data mining, information retrieval, and pattern recognition. We consider the case where ...

application/pdf

PDF (819kB)
• (1994)
This thesis studies the construction of expanding graphs and their applications to parallel computation. In particular, we consider explicit construction techniques, based on finite fields, that provide graphs which exhibit ...

application/pdf

PDF (4MB)