• Fast Multi-Level Co-Clustering 

  Xu, Haifeng (2013)

  We present a new multilevel method for hierarchical co-clustering. The fast multilevel co-clustering method (FMCC) implements a bi-coarsening process on the bipartite graph induced by the feature matrix. It does so in a ...

• Entity Matching and Disambiguation Across Multiple Knowledge Graphs 

  Farag, Michael (University of Waterloo, 2019-06-10)

  Knowledge graphs are considered an important representation that lie between free text on one hand and fully-structured relational data on the other. Knowledge graphs are a back-bone of many applications on the Web. With ...

• Theoretical foundations for efficient clustering 

  Kushagra, Shrinu (University of Waterloo, 2019-06-07)

  Clustering aims to group together data instances which are similar while simultaneously separating the dissimilar instances. The task of clustering is challenging due to many factors. The most well-studied is the high ...

• A Study on the Effects of Exception Usage in Open-Source C++ Systems 

  Bradley, Kirsten (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 ...

• Leveraging Asymmetry and Interdependence to Enhance Social Connectedness in Cooperative Digital Games 

  Harris, John Joseph (University of Waterloo, 2019-05-24)

  Play is a fundamental component of human development and is an important means of forming healthy relationships throughout life. Research has shown that the types of digital games people play, how they play them, and who ...

• High Performance Web Servers: A Study In Concurrent Programming Models 

  Radhakrishnan, Srihari (University of Waterloo, 2019-05-24)

  With the advent of commodity large-scale multi-core computers, the performance of software running on these computers has become a challenge to researchers and enterprise developers. While academic research and industrial ...

• ShallowForest: Optimizing All-to-All Data Transmission in WANs 

  Tan, Hao (University of Waterloo, 2019-05-23)

  All-to-all data transmission is a typical data transmission pattern in both consensus protocols and blockchain systems. Developing an optimization scheme that provides high throughput and low latency data transmission can ...

• The number of valid factorizations of Fibonacci prefixes 

  Bonardo, Pierre; Frid, Anna; Shallit, Jeffrey (Elsevier, 2019-07-05)

  We establish several recurrence relations and an explicit formula for , the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci ...

• BotChase: Graph-Based Bot Detection Using Machine Learning 

  Abou Daya, Abbas (University of Waterloo, 2019-05-21)

  Bot detection using machine learning (ML), with network flow-level features, has been extensively studied in the literature. However, existing flow-based approaches typically incur a high computational overhead and do not ...

• Dynamical Systems in Spiking Neuromorphic Hardware 

  Voelker, Aaron Russell (University of Waterloo, 2019-05-10)

  Dynamical systems are universal computers. They can perceive stimuli, remember, learn from feedback, plan sequences of actions, and coordinate complex behavioural responses. The Neural Engineering Framework (NEF) provides ...

• End-to-end Neural Information Retrieval 

  Yang, Wei (University of Waterloo, 2019-04-30)

  In recent years we have witnessed many successes of neural networks in the information retrieval community with lots of labeled data. Yet it remains unknown whether the same techniques can be easily adapted to search ...

• Sift: Achieving Resource-Efficient Consensus with RDMA 

  Kazhamiaka, Mikhail (University of Waterloo, 2019-04-30)

  Sift is a new consensus protocol for replicating state machines. It disaggregates CPU and memory consumption by creating a novel system architecture enabled by one-sided RDMA operations. We show that this system architecture ...

• Increasing the Efficiency of High-Recall Information Retrieval 

  Zhang, Haotian (University of Waterloo, 2019-04-30)

  The goal of high-recall information retrieval (HRIR) is to find all, or nearly all, relevant documents while maintaining reasonable assessment effort. Achieving high recall is a key problem in the use of applications ...

• C∀ Type System Implementation 

  Moss, Aaron (University of Waterloo, 2019-04-30)

  The C programming language has been an important software development tool for decades. C∀ is a new programming language designed with strong backwards-compatibility to take advantage of widely distributed C programming ...

• Succinct Data Structures for Chordal Graphs 

  Wu, Kaiyu (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 ...

• Formal Methods in Quantum Circuit Design 

  Amy, Matthew (University of Waterloo, 2019-02-26)

  The design and compilation of correct, efficient quantum circuits is integral to the future operation of quantum computers. This thesis makes contributions to the problems of optimizing and verifying quantum circuits, with ...

• An Analysis on The Network Structure of Influential Communities in Twitter 

  Schunk, Adam (University of Waterloo, 2019-02-21)

  Over the past years online social networks have become a major target for marketing strategies, generating a need for methods to efficiently spread information through these networks. Close knit communities have developed ...

• Detecting Vulnerable JavaScript Libraries in Hybrid Android Applications 

  Volodin, Nikita (University of Waterloo, 2019-02-15)

  Smartphone devices are very popular. There are a lot of devices being sold, a lot of applications that are created and a lot of people using those applications. However, mobile applications could only be created in the ...

• Applications of Artificial Intelligence to the NHL Entry Draft 

  Alcox, Brandon (University of Waterloo, 2019-01-31)

  This thesis investigates the application of various fields of artificial intelligence to the domain of sports management and analysis. The research in this thesis is primarily focussed on the entry draft for the National ...

• Bounds on Maximum Matchings in 1-Planar Graphs 

  Wittnebel, John (University of Waterloo, 2019-01-29)

  In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these ...

View more