Browsing Computer Science by Title
Now showing items 274-293 of 1553
-
Convex Large Margin Training - Unsupervised, Semi-supervised, and Robust Support Vector Machines
(University of Waterloo, 2007-05-22)Support vector machines (SVMs) have been a dominant machine learning technique for more than a decade. The intuitive principle behind SVM training is to find the maximum margin separating hyperplane for a given set of ... -
Convolutional Neural Network for Sentence Classification
(University of Waterloo, 2015-08-26)The goal of a Knowledge Base–supported Question Answering (KB-supported QA) system is to answer a query natural language by obtaining the answer from a knowledge database, which stores knowledge in the form of (entity, ... -
Coordination in a Peer Production Platform: A study of Reddit's /r/Place experiment
(University of Waterloo, 2018-10-24)Understanding the factors causing groups to engage in coordinating behaviour has been an active research area for decades. In this thesis, we study this problem using a novel dataset of crowd behaviour from an online ... -
COPIA: A New Software for Finding Consensus Patterns in Unaligned Protein Sequences
(University of Waterloo, 2001)Consensus pattern problem (CPP) aims at finding conserved regions, or motifs, in unaligned sequences. This problem is NP-hard under various scoring schemes. To solve this problem for protein sequences more efficiently,a ... -
A Cost Model for a Fingered Join Operator in Relational Query Plans
(University of Waterloo, 2015-08-12)We introduce the finger aware cursor operator for relational join queries. It scans a list of tuples in a finger enabled manner when a nested loop join operation is performed. Using this scan operation, we improve the ... -
Counting Flimsy Numbers via Formal Language Theory
(University of Waterloo, 2021-02-02)Let s_2(n) be the sum of the digits of n when expressed in base 2. For integers n and k, Stolarsky defined n to be k-flimsy if s_2(kn) < s_2(n). In this paper, we generalize the definition of k-flimsy numbers to all bases ... -
Counting, Adding, and Regular Languages
(University of Waterloo, 2018-12-17)In this thesis we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number ... -
Cracking the Code: Unraveling Gender Disparities in Open-Source Contributions
(University of Waterloo, 2023-09-28)Within the world of open source software (OSS) development, previous research has shown that the success rate of pull requests (PRs) may exhibit gender-related imbalances. In this work, we seek to examine which factors ... -
Crawling, Collecting, and Condensing News Comments
(University of Waterloo, 2013-11-29)Traditionally, public opinion and policy is decided by issuing surveys and performing censuses designed to measure what the public thinks about a certain topic. Within the past five years social networks such as Facebook ... -
Creating an Emotion Responsive Dialogue System
(University of Waterloo, 2018-10-19)The popularity of deep neural networks and vast amounts of readily available multi-domain textual data has seen the advent of various domain/task specific and domain agnostic dialogue systems. In our work, we present a ... -
Creating Your Bubble: Personal Space On and Around Large Public Displays
(ACM, 2016-05)We describe an empirical study that explores how users establish and use personal space around large public displays (LPDs). Our study complements field studies in this space by more fully characterizing interpersonal ... -
Critical Exponents and Stabilizers of Infinite Words
(University of Waterloo, 2008-04-01)This thesis concerns infinite words over finite alphabets. It contributes to two topics in this area: critical exponents and stabilizers. Let w be a right-infinite word defined over a finite alphabet. The critical ... -
Critical exponents of infinite balanced words
(Elsevier, 2019-07-19)Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2 + root2/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5 + root5)/4. Over larger ... -
Cross-Domain Sentence Modeling for Relevance Transfer with BERT
(University of Waterloo, 2019-12-16)Standard bag-of-words term-matching techniques in document retrieval fail to exploit rich semantic information embedded in the document texts. One promising recent trend in facilitating context-aware semantic matching has ... -
Cross-Lingual Entity Matching for Knowledge Graphs
(University of Waterloo, 2020-12-14)Multilingual knowledge graphs (KGs), such as YAGO and DBpedia, represent entities in different languages. The task of cross-lingual entity matching is to align entities in a source language with their counterparts in target ... -
Cryptographic End-to-end Verification for Real-world Elections
(University of Waterloo, 2012-07-05)In this dissertation we study the problem of making electronic voting trustworthy through the use of cryptographic end-to-end (E2E) audits. In particular, we present a series of novel proposals for cryptographic election ... -
Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication
(University of Waterloo, 2009-06-26)This thesis includes my research on efficient cryptographic protocols, sensor network key management, and radio frequency identification (RFID) authentication protocols. Key exchange, identification, and public key ... -
Crystallizing Application Configurations
(University of Waterloo, 2006)Software applications have both static and dynamic dependencies. Static dependencies are those derived from the source code. Dynamic runtime dependencies are established at runtime and may be based on information ... -
Cyberheroes: The Design and Evaluation of an Interactive Ebook to Educate Children about Online Privacy
(Elsevier, 2017-07)We designed an educational interactive ebook called Cyberheroes and evaluated it to assess its effectiveness at increasing children’s online privacy knowledge and behaviour, and supporting child-parent privacy-related ... -
The C∀ Scheduler
(University of Waterloo, 2022-12-02)User-Level threading (M:N) is gaining popularity over kernel-level threading (1:1) in many programming languages. The user threading approach is often a better mechanism to express complex concurrent applications by ...