Now showing items 41-60 of 1544

    • Toward an improved understanding of software change 

      Zou, Lijie (University of Waterloo, 2003)
      Structural changes, including moving, renaming, merging and splitting are important design change decisions made by programmers. However, during the process of software evolution, this information often gets lost. ...
    • Fast Extraction of BRDFs and Material Maps from Images 

      Jaroszkiewicz, Rafal (University of Waterloo, 2003)
      The bidirectional reflectance distribution function has a four dimensional parameter space and such high dimensionality makes it impractical to use it directly in hardware rendering. When a BRDF has no analytical ...
    • Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials 

      Cheng, Howard (University of Waterloo, 2003)
      In this thesis we study algorithms for computing normal forms for matrices of Ore polynomials while controlling coefficient growth. By formulating row reduction as a linear algebra problem, we obtain a fraction-free ...
    • Numerical Methods for Nonlinear Equations in Option Pricing 

      Pooley, David (University of Waterloo, 2003)
      This thesis explores numerical methods for solving nonlinear partial differential equations (PDEs) that arise in option pricing problems. The goal is to develop or identify robust and efficient techniques that ...
    • Mining Topic Signals from Text 

      Al-Halimi, Reem Khalil (University of Waterloo, 2003)
      This work aims at studying the effect of word position in text on understanding and tracking the content of written text. In this thesis we present two uses of word position in text: topic word selectors and topic flow ...
    • Evaluation of Shortest Path Query Algorithm in Spatial Databases 

      Lim, Heechul (University of Waterloo, 2003)
      Many variations of algorithms for finding the shortest path in a large graph have been introduced recently due to the needs of applications like the Geographic Information System (GIS) or Intelligent Transportation System ...
    • Implementing Overloading and Polymorphism in Cforall 

      Bilson, Richard C. (University of Waterloo, 2003)
      The programming language Cforall extends the C language with, among other things, overloading, parametric polymorphism, and functions that can return multiple values from a single call. This thesis presents an outline ...
    • Ownership Masks, Evolving Views and Cooperative Templates in Template Tracking 

      Angold, Alan (University of Waterloo, 2003)
      A template tracker is a tracker based on matching a pre-initialised view of an object with the object's view in an image sequence. Using an error function, the intensity difference between the template view and the ...
    • Adaptive Comparison-Based Algorithms for Evaluating Set Queries 

      Mirzazadeh, Mehdi (University of Waterloo, 2004)
      In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and ...
    • Cache-Oblivious Searching and Sorting in Multisets 

      Farzan, Arash (University of Waterloo, 2004)
      We study three problems related to searching and sorting in multisets in the cache-oblivious model: Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in ...
    • Ordered Interval Routing Schemes 

      Ahmed, Mustaq (University of Waterloo, 2004)
      An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint ...
    • Updating the Vertex Separation of a Dynamically Changing Tree 

      Olsar, Peter (University of Waterloo, 2004)
      This thesis presents several algorithms that update the vertex separation of a tree after the tree is modified; the vertex separation of a graph measures the largest number of vertices to the left of and including a vertex ...
    • Monoids and the State Complexity of the Operation root(<i>L</i>) 

      Krawetz, Bryan (University of Waterloo, 2004)
      In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations of regular languages. As well, we consider the state ...
    • Virtual Frameworks for Source Migration 

      Chi, Jack (University of Waterloo, 2004)
      <em>Virtual Frameworks</em> for source migration is a methodology to extract classes and interfaces from one or more frameworks used by an application. After migration, a new set of frameworks called virtual frameworks ...
    • A Hybrid Symbolic-Numeric Method for Multiple Integration Based on Tensor-Product Series Approximations 

      Carvajal, Orlando A (University of Waterloo, 2004)
      This work presents a new hybrid symbolic-numeric method for fast and accurate evaluation of multiple integrals, effective both in high dimensions and with high accuracy. In two dimensions, the thesis presents an adaptive ...
    • A Java Toolkit for Distributed Evaluation of Hypergeometric Series 

      Chughtai, Fawad (University of Waterloo, 2004)
      Hypergoemetric Series are very important in mathematics and come up regularly when dealing with the precise definitions of constants such as <i>e</i>, &pi; and Apery's constant &sigmaf;(3). The evaluation of such series ...
    • An Architecture For Multi-Agent Systems Operating In Soft Real-Time Environments With Unexpected Events 

      Micacchi, Christopher (University of Waterloo, 2004)
      In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft ...
    • Mining Software Repositories to Assist Developers and Support Managers 

      Hassan, Ahmed (University of Waterloo, 2004)
      This thesis explores mining the evolutionary history of a software system to support software developers and managers in their endeavors to build and maintain complex software systems. We introduce the idea of ...
    • Comparison of Cylindrical Boundary Pasting Methods 

      Aggarwal, Shalini (University of Waterloo, 2004)
      Surface pasting is an interactive hierarchical modelling technique used to construct surfaces with varying levels of local detail. The concept is similar to that of the physical process of modelling with clay, where ...
    • Admission Control for Independently-authored Realtime Applications 

      Kroeger, Robert (University of Waterloo, 2004)
      This thesis presents the LiquiMedia operating system architecture. LiquiMedia is specialized to schedule multimedia applications. Because they generate output for a human observer, multimedia applications such as ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages