Now showing items 21-40 of 3021

    • A Probabilistic Approach to Image Feature Extraction, Segmentation and Interpretation 

      Pal, Christopher Joseph (University of Waterloo, 2000)
      This thesis describes a probabilistic approach to imagesegmentation and interpretation. The focus of the investigation is the development of a systematic way of combining color, brightness, texture and geometric features ...
    • A Scalable Partial-Order Data Structure for Distributed-System Observation 

      Ward, Paul (University of Waterloo, 2001)
      Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe ...
    • Multi-dimensional Interval Routing Schemes 

      Ganjali, Yashar (University of Waterloo, 2001)
      Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy for routing messages ...
    • Parking Functions and Related Combinatorial Structures. 

      Rattan, Amarpreet (University of Waterloo, 2001)
      The central topic of this thesis is parking functions. We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing ...
    • New Convex Relaxations for the Maximum Cut and VLSI Layout Problems 

      Ferreira Fialho dos Anjos, Miguel Nuno (University of Waterloo, 2001)
      It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ...
    • Folding and Unfolding 

      Demaine, Erik (University of Waterloo, 2001)
      The results of this thesis concern folding of one-dimensional objects in two dimensions: planar linkages. More precisely, a planar linkage consists of a collection of rigid bars (line segments) connected at their ...
    • Cache Oblivious Data Structures 

      Ohashi, Darin (University of Waterloo, 2001)
      This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do ...
    • Maintaining Quality of Service for Adaptive Mobile Map Clients 

      Abdelsalam, Wegdan Ahmad Elsay Fouad (University of Waterloo, 2001)
      Mobile devices must deal with limited and dynamically varying resources, in particular, the network quality of service (QoS). In addition, wireless devices have other constraints such as limited memory, battery power, ...
    • Reliable Transport Performance in Mobile Environments 

      McSweeney, Martin (University of Waterloo, 2001)
      Expanding the global Internet to include mobile devices is an exciting area of current research. Because of the vast size of the Internet, and because the protocols in it are already widely deployed, mobile devices must ...
    • Techniques of Side Channel Cryptanalysis 

      Muir, James (University of Waterloo, 2001)
      The traditional model of cryptography examines the security of cryptographic primitives as mathematical functions. This approach does not account for the physical side effects of using these primitives in the real world. ...
    • The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs 

      Bauman, Shane (University of Waterloo, 2001)
      A balanced tournament design of order <I>n</I>, BTD(<I>n</I>), defined on a 2<I>n</I>-set<I> V</i>, is an arrangement of the all of the (2<I>n</i>2) distinct unordered pairs of elements of <I>V</I> into an <I>n</I> X ...
    • Modeling Protein Secondary Structure by Products of Dependent Experts 

      Cumbaa, Christian (University of Waterloo, 2001)
      A phenomenon as complex as protein folding requires a complex model to approximate it. This thesis presents a bottom-up approach for building complex probabilistic models of protein secondary structure by incorporating ...
    • Modelling Issues in Three-state Progressive Processes 

      Kopciuk, Karen (University of Waterloo, 2001)
      This dissertation focuses on several issues pertaining to three-state progressive stochastic processes. Casting survival data within a three-state framework is an effective way to incorporate intermediate events into an ...
    • COPIA: A New Software for Finding Consensus Patterns in Unaligned Protein Sequences 

      Liang, Chengzhi (University of Waterloo, 2001)
      Consensus pattern problem (CPP) aims at finding conserved regions, or motifs, in unaligned sequences. This problem is NP-hard under various scoring schemes. To solve this problem for protein sequences more efficiently,a ...
    • Automated Analysis of Unified Modeling Language (UML) Specifications 

      Tanuan, Meyer C. (University of Waterloo, 2001)
      The Unified Modeling Language (UML) is a standard language adopted by the Object Management Group (OMG) for writing object-oriented (OO) descriptions of software systems. UML allows the analyst to add class-level and ...
    • Topic-Oriented Collaborative Web Crawling 

      Chung, Chiasen (University of Waterloo, 2001)
      A <i>web crawler</i> is a program that "walks" the Web to gather web resources. In order to scale to the ever-increasing Web, multiple crawling agents may be deployed in a distributed fashion to retrieve web data ...
    • Two- and Three-Dimensional Coding Schemes for Wavelet and Fractal-Wavelet Image Compression 

      Alexander, Simon (University of Waterloo, 2001)
      This thesis presents two novel coding schemes and applications to both two- and three-dimensional image compression. Image compression can be viewed as methods of functional approximation under a constraint on the amount ...
    • Shortest Path Queries in Very Large Spatial Databases 

      Zhang, Ning (University of Waterloo, 2001)
      Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly ...
    • A Framework for Software Component Interface Specification and Analysis 

      Hoyt, Matthew (University of Waterloo, 2001)
      Although markets are emerging for commercial off-the-shelf components (such as Sun JavaBeans), there are many barriers to widespread component adoption. This is due to the inherent `black-box' nature of software ...
    • Quantitative Testing of Probabilistic Phase Unwrapping Methods 

      Moran, Jodi (University of Waterloo, 2001)
      The reconstruction of a phase surface from the observed principal values is required for a number of applications, including synthetic aperture radar (SAR) and magnetic resonance imaging (MRI). However, the process of ...


      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