Browsing Computer Science by Title
Now showing items 1355-1374 of 1551
-
Succinct Representation of Trees and Graphs
(University of Waterloo, 2009-10-29)In this thesis, we study succinct representations of trees and graphs. A succinct representation of a combinatorial object is a space efficient representation that supports a reasonable set of operations and queries on the ... -
Suitability of Java for Solving Large Sparse Positive Definite Systems of Equations Using Direct Methods
(University of Waterloo, 2004)The purpose of the thesis is to determine whether Java, a programming language that evolved out of a research project by Sun Microsystems in 1990, is suitable for solving large sparse linear systems using direct methods. ... -
Supporting Development Decisions with Software Analytics
(University of Waterloo, 2014-04-29)Software practitioners make technical and business decisions based on the understanding they have of their software systems. This understanding is grounded in their own experiences, but can be augmented by studying various ... -
Supporting Exploratory Search Tasks Through Alternative Representations of Information
(University of Waterloo, 2020-05-14)Information seeking is a fundamental component of many of the complex tasks presented to us, and is often conducted through interactions with automated search systems such as Web search engines. Indeed, the ubiquity of Web ... -
Supporting Framework Use via Automatically Extracted Concept-Implementation Templates
(University of Waterloo, 2009-04-27)Object-oriented application frameworks allow the reuse of both software design and code and are one of the most effective reuse technologies available today. Frameworks provide domain-specific concepts, which are generic ... -
Supporting Voice-Based Natural Language Interactions for Information Seeking Tasks of Various Complexity
(University of Waterloo, 2021-05-25)Natural language interfaces have seen a steady increase in their popularity over the past decade leading to the ubiquity of digital assistants. Such digital assistants include voice activated assistants, such as Amazon's ... -
SURF: Software Update Registration Framework
(University of Waterloo, 2018-10-25)BlockSURF (Blockchain-based Secure Update Registration Framework) or SURF, in short, is a software framework designed to enable developers to build a blockchain-based secure update system which distributes trust over a ... -
Surface-Only Liquids
(Association for Computing Machinery, 2016-07-01)We propose a novel surface-only technique for simulating incompressible, inviscid and uniform-density liquids with surface tension in three dimensions. The liquid surface is captured by a triangle mesh on which a Lagrangian ... -
Survivable Virtual Network Embedding in Transport Networks
(University of Waterloo, 2020-07-28)Network Virtualization (NV) is perceived as an enabling technology for the future Internet and the 5th Generation (5G) of mobile networks. It is becoming increasingly difficult to keep up with emerging applications’ Quality ... -
Suspenseful Design: Engaging Emotionally with Complex Applications through Compelling Narratives
(University of Waterloo, 2014-09-29)Stories are fundamental to how we learn about and experience the world, but few software interfaces incorporate stories or use story-telling techniques. This thesis explores the possibility of applying principles of ... -
Switching GAN-based Image Filters to Improve Perception for Autonomous Driving
(University of Waterloo, 2019-10-24)Autonomous driving holds the potential to increase human productivity, reduce accidents caused by human errors, allow better utilization of roads, reduce traffic accidents and congestion, free up parking space and provide ... -
Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
(IEEE, 2015-05)Product line (PL) engineering promotes the de- velopment of families of related products, where individual products are differentiated by which optional features they include. Modelling and analyzing requirements models ... -
A Symmetric Interaction Model for Bimanual Input
(University of Waterloo, 2006)People use both their hands together cooperatively in many everyday activities. The modern computer interface fails to take advantage of this basic human ability, with the exception of the keyboard. However, the keyboard ... -
Symmetry Reduction and Compositional Verification on Timed Automata
(University of Waterloo, 2017-08-24)This thesis is about techniques for the analysis of concurrent and real-time systems. As the first contribution, we describe a technique that incorporates automatic symmetry detection and symmetry reduction in the ... -
Syntactic Complexities of Nine Subclasses of Regular Languages
(University of Waterloo, 2012-07-31)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ... -
Syntactic Complexities of Six Classes of Star-Free Languages
(Otto-von-Guericke-Universit¨at Magdeburg, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semi-group. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ... -
Syntactic Complexities of Some Classes of Star-Free Languages
(Springer, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ... -
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
(Elsevier, 2012-08-31)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ... -
Syntactic Complexity Of R- And J-Trivial Regular Languages
(World Scientific Publishing, 2014-11-01)The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ... -
Syntactic Complexity of Regular Ideals
(Springer, 2017-08-04)The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...