Browsing Computer Science by Title
Now showing items 729-748 of 1551
-
Intersperse Coloring
(University of Waterloo, 2007-09-27)In this thesis, we introduce the intersperse coloring problem, which is a generalized version of the hypergraph coloring problem. In the intersperse coloring problem, we seek a coloring that assigns at least l different ... -
Inverted Index Partitioning Strategies for a Distributed Search Engine
(University of Waterloo, 2010-12-21)One of the greatest challenges in information retrieval is to develop an intelligent system for user and machine interaction that supports users in their quest for relevant information. The dramatic increase in the amount ... -
Inverting Permutations In Place
(University of Waterloo, 2015-08-17)We address the problem of quickly inverting the standard representation of a permutation on $n$ elements in place. First, we present a naive algorithm to do it using $O(\log n)$ extra bits in $O(n^2)$ time in the worst ... -
Investigating New Forms of Single-handed Physical Phone Interaction with Finger Dexterity
(University of Waterloo, 2023-08-14)With phones becoming more powerful and such an essential part of our lives, manufacturers are creating new device forms and interactions to better support even more diverse functions. A common goal is to enable a larger ... -
Investigating Selection above a Multitouch Surface
(University of Waterloo, 2012-10-25)Above-surface interaction is a new and exciting topic in the field of human-computer interaction (HCI). It focuses on the design and evaluation of systems that humans can operate by moving their hands in the space above ... -
An Investigation of Human Annotators' AI Teammate Selection and Compliance Behaviours
(University of Waterloo, 2024-01-18)Human-artificial intelligence (AI) collaborative annotation has gained increasing prominence as a result of its enormous potential to complement human and AI strengths as well as AI's recent development. However, it is not ... -
An Investigation of Preference Judging Consistency
(University of Waterloo, 2023-04-12)Preference judging has been proposed as an effective method to identify the most relevant documents for a given search query. In this thesis, we investigate the degree to which assessors using a preference judging system ... -
An Investigation of Word Sense Disambiguation for Improving Lexical Chaining
(University of Waterloo, 2006)This thesis investigates how word sense disambiguation affects lexical chains, as well as proposing an improved model for lexical chaining in which word sense disambiguation is performed prior to lexical chaining. A ... -
Iterative Edit-based Unsupervised Sentence Simplification
(University of Waterloo, 2020-07-28)We present a new iterative approach towards unsupervised edit-based sentence simplification. Our approach is guided by a scoring function to select simplified sentences generated after iteratively performing word and ... -
A Java Toolkit for Distributed Evaluation of Hypergeometric Series
(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>, π and Apery's constant ς(3). The evaluation of such series ... -
JITGNN: A Deep Graph Neural Network for Just-In-Time Bug Prediction
(University of Waterloo, 2022-05-10)Just-In-Time (JIT) bug prediction is the problem of predicting software failure immediately after a change is submitted to the code base. JIT bug prediction is often preferred to other types of bug prediction (subsystem, ... -
Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens
(University of Waterloo, 2020-08-07)Join cardinality estimation is a fundamental problem that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational ... -
Juicy Haptic Design: Vibrotactile Embellishments Can Improve Player Experience in Games
(ACM, 2021-05)Game designers and researchers employ a sophisticated language for producing great player experiences with concepts such as juici- ness, which refers to excessive positive feedback. However, much of their discourse excludes ... -
The k-best paths in Hidden Markov Models. Algorithms and Applications to Transmembrane Protein Topology Recognition.
(University of Waterloo, 2009-08-26)Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a ... -
Kernel Methods in Computer-Aided Constructive Drug Design
(University of Waterloo, 2009-05-14)A drug is typically a small molecule that interacts with the binding site of some target protein. Drug design involves the optimization of this interaction so that the drug effectively binds with the target protein while ... -
Kernel- vs. User-Level Networking: A Ballad of Interrupts and How to Mitigate Them
(University of Waterloo, 2023-07-06)Networking performance has become especially important in the current age with growing demands on services over the Internet. Recent advances in network controllers has exposed bottlenecks in various parts of network ... -
KG-Pipeline: An Automated Knowledge Graph Generation Framework
(University of Waterloo, 2022-09-16)Knowledge Graphs (KGs) have many applications, specifically in information retrieval and question answering. Community projects are conducted for building large-scale KGs with crowdsourcing, but building KGs with this ... -
Kinematic Templates: Guiding Cursor Movement in End-User Drawing Tools
(University of Waterloo, 2009-08-26)This thesis presents kinematic templates, end-user drawing tools that influence the mouse cursor's movement within specific areas of a digital canvas. Two types of kinematic templates influence the cursor's movement: ... -
Knowledge Graph Imputation
(University of Waterloo, 2021-05-27)Knowledge graphs are one of the most important resources of information in many applications such as question answering and social networks. These knowledge graphs however, are often far from complete as there are so many ... -
Laconic Evaluation of Branching Programs from the Diffie-Hellman Assumption
(University of Waterloo, 2024-05-02)Secure two-party computation (2PC) enables two parties to compute a function f on their joint inputs while keeping their inputs private. Laconic cryptography is a special type of 2PC in which this is done with asymptotically ...