Browsing Computer Science by Title
Now showing items 1389-1408 of 1567
-
Synthesis and evaluation of geometric textures
(University of Waterloo, 2013-09-06)Two-dimensional geometric textures are the geometric analogues of raster (pixel-based) textures and consist of planar distributions of discrete shapes with an inherent structure. These textures have many potential ... -
Systematically Detecting Access Control Flaws in the Android Framework
(University of Waterloo, 2022-08-25)Android's permission model is used to regulate access to the Application Program Interfaces (APIs) within the Android system services, which provide access to sensitive system resources, such as the camera and microphone. ... -
Systems and Algorithms for Dynamic Graph Processing
(University of Waterloo, 2023-03-10)Data generated from human and systems interactions could be naturally represented as graph data. Several emerging applications rely on graph data, such as the semantic web, social networks, bioinformatics, finance, and ... -
Systems for Graph Extraction from Tabular Data
(University of Waterloo, 2020-09-28)Connections amongst real-world entities provide significant insights for numerous real-life applications in social networks, semantic web, road maps, finance, among others. Graphs are perhaps the most natural way to model ... -
Systems for Managing Work-Related Transitions
(University of Waterloo, 2020-01-17)Peoples' work lives have become ever-populated with transitions across tasks, devices, and environments. Despite their ubiquitous nature, managing transitions across these three domains has remained a significant challenge. ... -
T-SIMn: Towards a Framework for the Trace-Based Simulation of 802.11n Networks
(University of Waterloo, 2016-02-17)With billions of WiFi devices now in use, and growing, combined with the rising popularity of high-bandwidth applications, such as streaming video, demands on WiFi networks continue to rise. To increase performance for ... -
Tabular Abstraction, Editing, and Formatting
(University of Waterloo, 2016-09-29)This dissertation investigates the composition of high-quality tables with the use of electronic tools. A generic model is designed to support the different stages of tabular composition, including the editing of logical ... -
Tagger: Enhance Database Search Tools with De Novo Sequencing Tags
(University of Waterloo, 2017-01-06)Tandem mass spectrometry (MS/MS) is widely used in proteomics nowadays to identify peptides and proteins from a sequence database. In a classic procedure of MS/MS protein identification, proteins are digested into short ... -
Task-Centric User Interfaces
(University of Waterloo, 2014-05-22)Software applications for design and creation typically contain hundreds or thousands of commands, which collectively give users enormous expressive power. Unfortunately, rich feature sets also take a toll on usability. ... -
TCP Connection Management Mechanisms for Improving Internet Server Performance
(University of Waterloo, 2005)This thesis investigates TCP connection management mechanisms in order to understand the behaviour and improve the performance of Internet servers during overload conditions such as flash crowds. We study several ... -
Techniques and heuristics for improving the visual design of software agreements
(University of Waterloo, 2010-09-10)End users must regularly agree to lengthy software agreements prior to installing software or using software services. However, despite the fact that these agreements contain terms of direct concern to users—e.g., data ... -
Techniques for creating ground-truthed sketch corpora
(University of Waterloo, 2009-08-26)The problem of recognizing handwritten mathematics notation has been studied for over forty years with little practical success. The poor performance of math recognition systems is due, at least in part, to a lack of ... -
Techniques for Quantum Computing
(University of Waterloo, 2007-09-21)This thesis is about techniques for quantum computing. A common theme throughout this work is the examination of how quantum algorithms and protocols might be implemented in practice. I explore this question at the level ... -
Temporal Logic Model Checking as Automated Theorem Proving
(University of Waterloo, 2016-01-19)Model checking is an automatic technique for the verification of temporal properties of a system. In this technique, a system is represented as a labelled graph and the specification as a temporal logic formula. The core ... -
Territoriality and Behaviour On and Around Large Vertical Publicly-Shared Displays
(University of Waterloo, 2012-06-07)Large displays and information kiosks are becoming increasingly common installations in public venues to provide an efficient self-serve means for patrons to access information and/or services. They have evolved over a ... -
Tessellating Algebraic Curves and Surfaces Using A-Patches
(University of Waterloo, 2008-05-16)This work approaches the problem of triangulating algebraic curves/surfaces with a subdivision-style algorithm using A-Patches. An implicit algebraic curve is converted from the monomial basis to the bivariate Bernstein-Bezier ... -
Test collections for web-scale datasets using Dynamic Sampling
(University of Waterloo, 2022-01-17)Dynamic Sampling is a non-uniform statistical sampling strategy based on S-CAL, a high-recall retrieval algorithm. It is used for the construction of statistical test collections for evaluating information retrieval ... -
Test-Time Training for Image Inpainting
(University of Waterloo, 2022-06-21)Image inpainting is the task of filling missing regions in images with plausible and coherent content. The usual process involves training a CNN on a large collection of examples that it can learn from, to later apply this ... -
Testing Submodularity
(University of Waterloo, 2017-09-28)We show that for any constants $\epsilon > 0$ and $p \ge 1$, given oracle access to an unknown function $f : \{0,1\}^n \to [0,1]$ it is possible to determine if the function is submodular or is $\epsilon$-far from every ... -
Testing vertex connectivity of bowtie 1-plane graphs
(University of Waterloo, 2022-07-18)A separating set of a connected graph $G$ is a set of vertices $S$ such that $G-S$ is disconnected. $S$ is a minimum separating set of $G$ if there is no separating set of $G$ with fewer vertices than $S$. The size of a ...