Browsing Mathematics (Faculty of) by Title
Now showing items 981-1000 of 3012
-
An Experimental Analysis of Multi-Perspective Convolutional Neural Networks
(University of Waterloo, 2018-05-16)Modelling the similarity of sentence pairs is an important problem in natural language processing and information retrieval, with applications in tasks such as paraphrase identification and answer selection in question ... -
Experimental Analysis of Opportunistic Communication for Vehicular Internet Access
(University of Waterloo, 2008-08-18)This thesis examines the problem of using 802.11 hotspots for vehicular Internet access. In this access paradigm, a user in a vehicle performs batch transfers by opportunistically communicating with roadside 802.11 access ... -
Expert System and a Rule Set Development Method for Urban Behaviour Planning
(University of Waterloo, 2020-05-15)Today, autonomous vehicles have the capacity to achieve fully autonomous driving in predefined environments. This ability can be in part attributed to advancements in motion planning, which plans the vehicle’ behaviours ... -
Explaining Expert Search and Team Formation Systems with ExES
(University of Waterloo, 2024-05-06)Expert search and team formation systems operate on collaboration networks with nodes representing individuals, labeled with their skills, and edges denoting collaboration relationships. Given a query corresponding to a ... -
Explicit Runge-Kutta time-stepping with the discontinuous Galerkin method
(University of Waterloo, 2018-04-20)In this thesis, the discontinuous Galerkin method is used to solve the hyperbolic equations. The DG method discretizes a system into a semi-discrete system and a system of ODEs is obtained. To solve this system of ODEs ... -
Exploitation of Redundant Inverse Term Frequency for Answer Extraction
(University of Waterloo, 2002)An automatic question answering system must find, within a corpus,short factual answers to questions posed in natural language. The process involves analyzing the question, retrieving information related to the question, ... -
Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning
(University of Waterloo, 2010-08-03)Boolean propositional satisfiability (SAT) and probabilistic reasoning represent two core problems in AI. Backtracking based algorithms have been applied in both problems. In this thesis, I investigate structure-based ... -
Exploiting the Computational Power of Ternary Content Addressable Memory
(University of Waterloo, 2011-09-30)Ternary Content Addressable Memory or in short TCAM is a special type of memory that can execute a certain set of operations in parallel on all of its words. Because of power consumption and relatively small storage ... -
Exploiting Token and Path-based Representations of Code for Identifying Security-Relevant Commits
(University of Waterloo, 2020-07-15)Public vulnerability databases such as CVE and NVD account for only 60% of security vulnerabilities present in open-source projects and are known to suffer from inconsistent quality. Over the last two years, there has been ... -
Explorations in Pairwise Measures of Dependence and Pooled Significance
(University of Waterloo, 2024-01-22)In the exploration of data sets with many variables, the search for interesting pairs is often the first step of analysis. This search builds a road map of the entirety of data before looking at its details, and can provide ... -
Explorations of Infinitesimal Inverse Spectral Geometry
(University of Waterloo, 2013-10-04)Spectral geometry is a mathematical discipline that studies the relationship between the geometry of Riemannian manifolds and the spectra of natural differential operators defined on them. The spectra of Laplacians are ... -
Explore the In-context Learning Capability of Large Language Models
(University of Waterloo, 2024-05-10)The rapid evolution of Large Language Models (LLMs) has marked the beginning of a new age in AI capabilities, particularly in the domain of natural language understanding and processing. Among the forefront of these ... -
Exploring Automatic Citation Classification
(University of Waterloo, 2008-05-21)Currently, citation indexes used by digital libraries are very limited. They only provide raw citation counts and link scientific articles through their citations. There are more than one type of citations, but citation ... -
Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes
(University of Waterloo, 2018-05-01)The story of this work is dimensionality reduction. Dimensionality reduction is a method that takes as input a point-set P of n points in R^d where d is typically large and attempts to find a lower-dimensional representation ... -
Exploring Practical Methodologies for the Characterization and Control of Small Quantum Systems
(University of Waterloo, 2018-09-04)We explore methodologies for characterizing and controlling small quantum systems. We are interested in starting with a description of a quantum system, designing estimators for parameters of the system, developing robust ... -
Exploring the Potential of Wrist-Worn Gesture Sensing
(University of Waterloo, 2018-01-22)This thesis aims to explore the potential of wrist-worn gesture sensing. There has been a large amount of work on gesture recognition in the past utilizing different kinds of sensors. However, gesture sets tested across ... -
Exponentially Dense Matroids
(University of Waterloo, 2011-12-15)This thesis deals with questions relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that does not contain a given rank-2 uniform matroid. The growth ... -
Extended Nonlocal Games
(University of Waterloo, 2017-03-31)The notions of entanglement and nonlocality are among the most striking ingredients found in quantum information theory. One tool to better understand these notions is the model of nonlocal games; a mathematical framework ... -
Extending Pappus' Theorem
(University of Waterloo, 2017-12-22)Let $M_1$ and $M_2$ be matroids such that $M_2$ arises from $M_1$ by relaxing a circuit-hyperplane. We will prove that if $M_1$ and $M_2$ are both representable over some finite field $GF(q)$, then $M_1$ and $M_2$ have ... -
Extensions of Galvin's Theorem
(University of Waterloo, 2018-04-30)We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin's resolution of the Dinitz problem (Galvin. J. Comb. Theory, Ser. B 63(1), 1995, 153--158). We ...