Browsing Computer Science by Title
Now showing items 194-213 of 1551
-
Closing the Modelling Gap: Transfer Learning from a Low-Fidelity Simulator for Autonomous Driving
(University of Waterloo, 2020-01-24)The behaviour planning subsystem, which is responsible for high-level decision making and planning, is an important aspect of an autonomous driving system. There are advantages to using a learned behaviour planning system ... -
CLPush: Proactive Cache Transfers in NUMA Applications
(University of Waterloo, 2023-09-26)Modern Non-Uniform Memory Access (NUMA) systems support a thread count of as much as 128 threads to support high performance applications. These systems usually employ a scalable cache-coherent directory mechanism to ensure ... -
Clustering Dependencies over Relational Tables
(University of Waterloo, 2016-01-22)Integrity constraints have proven to be valuable in the database field. Not only can they help schema design (functional dependencies, FDs [1][2]), they can also be used in query optimization (ordering dependencies, ODs ... -
Clustering in the Presence of Noise
(University of Waterloo, 2013-08-26)Clustering, which is partitioning data into groups of similar objects, has a wide range of applications. In many cases unstructured data makes up a significant part of the input. Attempting to cluster such part of the data, ... -
Coding Strip: A Tool for Supporting Interplay within Abstraction Ladder for Computational Thinking
(University of Waterloo, 2022-05-20)As technologies advance and play an increasingly larger role in our lives, computational thinking---the ability to understand computing concepts and procedures and their role in the tools we use---has become an important ... -
A Collapsing Method for Efficient Recovery of Optimal Edges
(University of Waterloo, 2002)In this thesis we present a novel algorithm, <I>HyperCleaning*</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges ... -
Combinatorial and Probabilistic Approaches to Motif Recognition
(University of Waterloo, 2010-11-10)Short substrings of genomic data that are responsible for biological processes, such as gene expression, are referred to as motifs. Motifs with the same function may not entirely match, due to mutation events at a few of ... -
Combinatorial Problems in Compiler Optimization
(University of Waterloo, 2013-04-22)Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines ... -
Compact Routing on Planar Graphs
(University of Waterloo, 2024-01-04)This thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static ... -
Comparing Smartphone Speech Recognition and Touchscreen Typing for Composition and Transcription
(University of Waterloo, 2020-08-28)Ruan et al. found transcribing short phrases with speech recognition nearly 200% faster than typing on a smartphone. We extend this comparison to a novel composition task, using a protocol that enables a controlled comparison ... -
Comparison of Cylindrical Boundary Pasting Methods
(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 ... -
Comparison of Exact and Approximate Multi-Objective Optimization for Software Product Lines
(University of Waterloo, 2013-10-25)Software product lines (SPLs) manage product variants in a systematical way and allow stakeholders to derive variants by selecting features. Finding a desirable variant is hard, due to the huge configuration space and ... -
A Comparison of the Declarative Modelling Languages B, Dash, and TLA+
(IEEE, 2019-08)Declarative behavioural modelling is a powerful modelling paradigm that enables users to model system func- tionality abstractly and concisely. We compare two well-used formal declarative modelling languages, B and TLA+, ... -
Compilation Techniques for Actively Secure Mixed Mode Two Party Computation
(University of Waterloo, 2019-09-03)Secure multiparty computation allows two or more parties to compute a function without leaking unnecessary information about their inputs to other parties. In traditional secure multiparty computation protocols, the function ... -
Compiler-Based Approach to Enhance BliMe Hardware Usability
(University of Waterloo, 2023-09-05)Outsourced computing has emerged as an efficient platform for data processing, but it has raised security concerns due to potential exposure of sensitive data through runtime and side-channel attacks. To address these ... -
Compiling Data Dependent Control Flow on SIMD GPUs
(University of Waterloo, 2004)Current Graphic Processing Units (GPUs) (circa. 2003/2004) have programmable vertex and fragment units. Often these units are implemented as SIMD processors employing parallel pipelines. Data dependent conditional ... -
Compiling Equality in an Abstract Relational Model via Preference Tables and Translation Tables
(University of Waterloo, 2022-12-07)Borgida et al. have introduced a refinement to the relational model (RM) [1] which they call the abstract relational model (ARM) that extends the former in the following three ways: 1. the addition of a new abstract ... -
Completely Customizing Modern GUIs Through Command-Driven Interfaces
(University of Waterloo, 2008-09-11)An ideal user interface accommodates the requirements and abilities of its users, and every user has a specific set of needs that must be fulfilled in order for an interface to be useful. This thesis concentrates on using ... -
Completeness of Fact Extractors and a New Approach to Extraction with Emphasis on the Refers-to Relation
(University of Waterloo, 2008-08-19)This thesis deals with fact extraction, which analyzes source code (and sometimes related artifacts) to produce extracted facts about the code. These facts may, for example, record where in the code variables are declared ... -
The Completeness Problem of Ordered Relational Databases
(University of Waterloo, 2010-08-30)Support of order in query processing is a crucial component in relational database systems, not only because the output of a query is often required to be sorted in a specific order, but also because employing order ...