Browsing Computer Science by Title
Now showing items 1155-1174 of 1551
-
Reconfiguring Graph Colorings
(University of Waterloo, 2017-08-29)Graph coloring has been studied for a long time and continues to receive interest within the research community \cite{kubale2004graph}. It has applications in scheduling \cite{daniel2004graph}, timetables, and compiler ... -
Reconfiguring Triangulations
(University of Waterloo, 2015-01-06)The results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations can be cast as reconfiguration problems. We ... -
Reconstructing hv-convex polyominoes with multiple colours
(University of Waterloo, 2009-08-26)This thesis examines the problem of reconstructing multiple discrete 2D objects, represented by a set of cells arranged in an m × n grid, from their projections. The objects being constructed are disjoint, hv-convex ... -
Reconstruction and Visualization of Polyhedra Using Projections
(University of Waterloo, 2005)Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and polyhedra, given a set of ... -
Reconstruction of Half-Sibling Population Structures
(University of Waterloo, 2012-10-25)Half-sibling reconstruction is the task of determining maternal and paternal sibling relationships from observed genotypes of same-generation individuals in a population. Knowledge of how populations are structured allows ... -
Reconstruction of Orthogonal Polyhedra
(University of Waterloo, 2008-02-20)In this thesis I study reconstruction of orthogonal polyhedral surfaces and orthogonal polyhedra from partial information about their boundaries. There are three main questions for which I provide novel results. The ... -
Reducing Data Copying Overhead in Web Servers
(University of Waterloo, 2010-07-13)Web servers that generate dynamic content are widely used in the development of Internet applications. With the Internet highly connected to people’s lifestyles, the service requirements of Internet applications have ... -
Reducing Health Misinformation in Search Results
(University of Waterloo, 2022-08-22)People commonly search the web for answers to health-related questions. With health information being added to the Internet every day, misinformation proliferates and disseminates wildly. Previous work has shown that if ... -
Reducing Interaction Cost: A Mechanism Deisgn Approach
(University of Waterloo, 2007-09-06)In this thesis we study the problem of requiring self-interested agents need to interact with some centralized mechanism where this interaction is costly. To improve their utility, agents may choose to interact ... -
Reducing the Cost of Operating a Datacenter Network
(University of Waterloo, 2012-05-01)Datacenters are a significant capital expense for many enterprises. Yet, they are difficult to manage and are hard to design and maintain. The initial design of a datacenter network tends to follow vendor guidelines, but ... -
Reducing the Latency of Dependent Operations in Large-Scale Geo-Distributed Systems
(University of Waterloo, 2021-10-14)Many applications rely on large-scale distributed systems for data management and computation. These distributed systems are complex and built from different networked services. Dependencies between these services can ... -
Refining, Implementing, and Evaluating the Extended Continuous Variable-Specific Resolutions of Feature Interactions
(University of Waterloo, 2016-08-19)Systems that involve feature-oriented software development suffer from feature interactions, in which features affect one another’s behaviour in surprising ways. As the number of features increases, the complexity of ... -
Refresh Strategies in Continuous Active Learning
(University of Waterloo, 2018-08-27)High recall information retrieval is crucial to tasks such as electronic discovery and systematic review. Continuous Active Learning (CAL) is a technique where a human assessor works in loop with a machine learning model; ... -
Regional Time Stepping for SPH
(The Eurographics Association, 2014)This paper presents novel and efficient strategies to spatially adapt the amount of computational effort applied based on the local dynamics of a free surface flow, for classic weakly compressible SPH (WCSPH). Using a ... -
Registering a Non-Rigid Multi-Sensor Ensemble of Images
(University of Waterloo, 2009-09-29)Image registration is the task of aligning two or more images into the same reference frame to compare or distinguish the images. The majority of registration methods deal with registering only two images at a time. Recently, ... -
Regular Pattern Detection and Analysis Using Shapelets
(University of Waterloo, 2014-10-27)The presence of regular patterns in natural and technological phenomena is pervasive, often being present in both time and space. To increase our understanding of many phenomena where patterns are present, measurable ... -
Related Orderings of AT-Free Graphs
(University of Waterloo, 2022-02-23)An ordering of a graph G is a bijection of V(G) to {1, . . . , |V(G)|}. In this thesis, we consider the complexity of two types of ordering problems. The first type of problem we consider aims at minimizing objective ... -
Reliable Transport Performance in Mobile Environments
(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 ... -
Rendering Antialiased Shadows using Warped Variance Shadow Maps
(University of Waterloo, 2008-05-06)Shadows contribute significantly to the perceived realism of an image, and provide an important depth cue. Rendering high quality, antialiased shadows efficiently is a difficult problem. To antialias shadows, it is necessary ... -
Repetition in Words
(University of Waterloo, 2013-08-23)The main topic of this thesis is combinatorics on words. The field of combinatorics on words dates back at least to the beginning of the 20th century when Axel Thue constructed an infinite squarefree sequence over a ternary ...