Browsing Mathematics (Faculty of) by Title
Now showing items 1318-1337 of 2993
-
An In-Depth Exploration of the High-Quality Entity Linking for Information Retrieval: MMEAD
(University of Waterloo, 2023-12-19)Entity linking has emerged significantly during the digital information explosion, aiming to provide context and meaning to huge amounts of unstructured data. While traditional information retrieval primarily relied on ... -
In-Memory Storage for Labeled Tree-Structured Data
(University of Waterloo, 2017-03-16)In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size ... -
In-Network Scheduling for Real-Time Analytics
(University of Waterloo, 2021-04-30)This thesis presents Bolt, a novel scheduler design for large-scale real-time data analytics. Bolt achieves the scheduling accuracy of modern centralized schedulers while supporting clusters with hundreds of thousands of ... -
In-vehicle Performance and Distraction for Midair and Touch Directional Gestures
(University of Waterloo, 2023-07-18)We compare the performance and level of distraction of expressive directional gesture input in the context of in-vehicle system commands. Center console touchscreen swipes and midair swipe-like movements are tested in ... -
Incentives in One-Sided Matching Problems With Ordinal Preferences
(University of Waterloo, 2016-07-27)One of the core problems in multiagent systems is how to efficiently allocate a set of indivisible resources to a group of self-interested agents that compete over scarce and limited alternatives. In these settings, mechanism ... -
Incentivizing evaluation with peer prediction and limited access to ground truth
(Elsevier, 2019-10)In many settings, an effective way of evaluating objects of interest is to collect evaluations from dispersed individuals and to aggregate these evaluations together. Some examples are categorizing online content and ... -
Incorporating Linear Dependencies into Graph Gaussian Processes
(University of Waterloo, 2023-08-28)Graph Gaussian processes are an important technique for learning unknown functions on graphs while quantifying uncertainty. These processes encode prior information by using kernels that reflect the structure of the graph, ... -
Increasing the Efficiency of High-Recall Information Retrieval
(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 ... -
Increasing the Semantic Similarity of Object-Oriented Domain Models by Performing Behavioral Analysis First
(University of Waterloo, 2006)The main goal of any object-oriented analysis (OOA) method is to produce a model that aids in understanding and communicating knowledge about a modeled domain. A higher degree of similarity among independently produced ... -
Incremental and Commutative Composition of State-Machine Models of Features
(IEEE, 2015-05)In this paper, we present a technique for incre- mental and commutative composition of state-machine models of features, using the FeatureHouse framework. The inputs to FeatureHouse are feature state-machines (or state-machine ... -
The Incremental Constraint of k-Server
(University of Waterloo, 2012-05-19)Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they produce a sequence of incremental solutions corresponding ... -
Independence conditions and the analysis of life history studies with intermittent observation
(Oxford University Press, 2021-07)Multistate models provide a powerful framework for the analysis of life history processes when the goal is to characterize transition intensities, transition probabilities, state occupancy probabilities, and covariate ... -
Independent Sets and Eigenspaces
(University of Waterloo, 2004)The problems we study in this thesis arise in computer science, extremal set theory and quantum computing. The first common feature of these problems is that each can be reduced to characterizing the independent sets ... -
Indexing Compressed Text
(University of Waterloo, 2003)As a result of the rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches ... -
Indirect Quantum Control: An Implementation-Independent Scheme
(University of Waterloo, 2016-08-17)The ability to control quantum systems rapidly as compared to their coherence times is a central requirement for most proposed quantum technologies, such as quantum computing and quantum metrology. Improving the ratio of ... -
Individual insurance choice: A stochastic control approach
(University of Waterloo, 2023-02-28)This thesis applies the stochastic control approach to study the optimal insurance strategy for three problems. The first problem studies the optimal non-life insurance for an individual exhibiting internal habit formation ... -
Induced Binary Submatroids
(University of Waterloo, 2021-07-21)The notion of induced subgraphs is extensively studied in graph theory. An example is the famous Gy\'{a}rf\'{a}s-Sumner conjecture, which asserts that given a tree $T$ and a clique $K$, there exists a constant $c$ such ... -
Induced Subgraphs and Tree Decompositions III. Three-Path-Configurations and Logarithmic Treewidth.
(Advances in Combinatorics, 2022-09-09)A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family H of graphs, we say a graph G is H-free if no induced subgraph of G is ... -
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
(Elsevier, 2020-01)We prove a conjecture of András Gyárfás, that for all k, l, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ. -
Induction Relations in the Symmetric Groups and Jucys-Murphy Elements
(University of Waterloo, 2018-08-16)Transitive factorizations faithfully encode many interesting objects. The well-known ones include ramified coverings of the sphere and hypermaps. Enumeration of specific classes of such objects have been known for quite ...