Browsing Computer Science by Title
Now showing items 735-754 of 1551
-
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 ... -
Large Aperiodic Semigroups
(World Scientific Publishing, 2015-11-01)We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ... -
Large-Scale Emulation of Anonymous Communication Networks
(University of Waterloo, 2014-08-15)Tor is the most popular low-latency anonymous communication system for the Internet, helping people to protect their privacy online and circumvent Internet censorship. Its low- latency anonymity and distributed design ... -
A Las Vegas Algorithm for the Ordered Majority Problem
(University of Waterloo, 2022-09-29)In this thesis, we study the majority problem using ordered comparisons under the Las Vegas randomized algorithm model. The majority problem asks whether a given set of n elements, each with some colour, has a colour which ... -
Lattice Compression of Polynomial Matrices
(University of Waterloo, 2007-05-01)This thesis investigates lattice compression of polynomial matrices over finite fields. For an m x n matrix, the goal of lattice compression is to find an m x (m+k) matrix, for some relatively small k, such that the ... -
Learn Privacy-friendly Global Gaussian Processes in Federated Learning
(University of Waterloo, 2022-08-17)In the era of big data, Federated Learning (FL) has drawn great attention as it naturally operates on distributed computational resources without the need of data warehousing. Similar to Distributed Learning (DL), FL ... -
Learn2Perturb: an End-to-end Feature Perturbation Learning to Improve Adversarial Robustness
(University of Waterloo, 2020-08-19)Deep neural networks have been achieving state-of-the-art performance across a wide variety of applications, and due to their outstanding performance, they are being deployed in safety and security critical systems. However, ...