Browsing Computer Science by Title
Now showing items 1334-1353 of 1551
-
Student Success in Co-operative Education: An Analysis of Job Postings and Performance Evaluations
(University of Waterloo, 2023-05-26)Co-operative education (co-op) programs combine coursework and work internships and have become popular worldwide. In this analysis, we use two separate co-op datasets to understand employer expectations and factors that ... -
A Study in Preference Elicitation under Uncertainty
(University of Waterloo, 2011-08-30)In many areas of Artificial Intelligence (AI), we are interested in helping people make better decisions. This help can result in two advantages. First, computers can process large amounts of data and perform quick ... -
A Study of Adaptation Mechanisms for Simulation Algorithms
(University of Waterloo, 2012-08-30)The performance of a program can sometimes greatly improve if it was known in advance the features of the input the program is supposed to process, the actual operating parameters it is supposed to work with, or the ... -
A Study of Efficiency, Accuracy, and Robustness in Intensity-Based Rigid Image Registration
(University of Waterloo, 2008-09-30)Image registration is widely used in different areas nowadays. Usually, the efficiency, accuracy, and robustness in the registration process are concerned in applications. This thesis studies these issues by presenting an ... -
A Study of Immediate Requery Behavior in Search
(Association for Computing Machinery, 2018-03-11)When search results fail to satisfy users' information needs, users often reformulate their search query in the hopes of receiving better results. In many cases, users immediately requery without clicking on any search ... -
A study of object creators in JavaScript
(University of Waterloo, 2017-08-23)Traditional object-oriented languages use typed classes to specify the shape and behaviour of objects. In JavaScript, object behaviour is less constrained. Learning how JavaScript programmers create objects can help us ... -
A study of one-turn quantum refereed games
(University of Waterloo, 2020-07-13)This thesis studies one-turn quantum refereed games, which are abstract zero-sum games with two competing computationally unbounded quantum provers and a computationally bounded quantum referee. The provers send quantum ... -
A Study of the Capabilities of Message-Oriented Middleware Systems
(University of Waterloo, 2023-01-27)We present a comprehensive characterization study of open-source Message-Oriented Middleware (MOM) systems. We devised a rigorous methodology to select and study 10 popular and diverse MOM systems. For each system, we ... -
A Study on the Effects of Exception Usage in Open-Source C++ Systems
(University of Waterloo, 2019-05-24)Exception handling (EH) is a feature common to many modern programming languages, including C++, Java, and Python, that allows error handling in client code to be performed in a way that is both systematic and largely ... -
Studying and Leveraging API Usage Patterns
(University of Waterloo, 2022-09-29)Software projects make use of libraries extensively. Libraries have intended API surfaces—sets of exposed library interfaces that library developers expect clients to use. However, in practice, clients only use small ... -
Studying Relevance Judging Behavior of Secondary Assessors
(University of Waterloo, 2016-08-03)Secondary assessors, individuals who do not originate search topics and are employed solely to judge the relevancy of documents, have been found to differ in their relevance judgments. Their relevance judgments are used ... -
Studying the Impact of Risk Assessment Analytics on Risk Awareness and Code Review Performance
(University of Waterloo, 2023-05-18)While code review is a critical component of modern software quality assurance, defects can still slip through the review process undetected. Previous research suggests that the main reason for this is a lack of reviewer ... -
Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity
(University of Waterloo, 2020-03-11)The Kolmogorov Complexity of an object is incomputable. But built in its structure is a way to specify description methods of an object that is computable in some sense. Such a description method then can be exploited ... -
StyleCounsel: Seeing the (Random) Forest for the Trees in Adversarial Code Stylometry
(University of Waterloo, 2018-01-12)Authorship attribution has piqued the interest of scholars for centuries, but had historically remained a matter of subjective opinion, based upon examination of handwriting and the physical document. Midway through the ... -
Subjective Mapping
(University of Waterloo, 2007-11-20)There are a variety of domains where it is desirable to learn a representation of an environment defined by a stream of sensori-motor experience. This dissertation introduces and formalizes subjective mapping, a novel ... -
Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation
(University of Waterloo, 2008-09-24)A time series is composed of a sequence of data items that are measured at uniform intervals. Many application areas generate or manipulate time series, including finance, medicine, digital audio, and motion capture. ... -
Subtle and Personal Workspace Requirements for Visual Search Tasks on Public Displays
(ACM Press, 2017-05-06)We explore how users approach and define personal space on large, public displays. Our results show that users of public displays use one of two strategies for visual search tasks: minimizers create a small window and work ... -
Subword complexity and power avoidance
(Elsevier, 2019-11-05)We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that –the Thue–Morse word has the minimum possible subword complexity over ... -
Succinct and Compact Data Structures for Intersection Graphs
(University of Waterloo, 2023-08-14)This thesis designs space efficient data structures for several classes of intersection graphs, including interval graphs, path graphs and chordal graphs. Our goal is to support navigational operations such as adjacent and ... -
Succinct Data Structures for Chordal Graphs
(University of Waterloo, 2019-04-10)We study the problem of approximate shortest path queries in chordal graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We ...