Browsing Computer Science by Title
Now showing items 974-993 of 1558
-
On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling
(University of Waterloo, 2006)Modern architectures allow multiple instructions to be issued at once and have other complex features. To account for this, compilers perform instruction scheduling after generating the output code. The instruction ... -
On the Number of Trials Needed to Obtain k Consecutive Successes
(Elsevier, 2021-04-30)A sequence of independent Bernoulli trials, each of which is a success with probability p, is conducted. For k ∈ Z+, let Xk be the number of trials required to obtain k consecutive successes. Using techniques from elementary ... -
On the Optical Monitoring of Anemia Severity Levels
(University of Waterloo, 2015-08-13)Anemia is a prevalent medical condition that seriously a ects millions of people all over the world. In many regions, not only its initial detection, but also its monitoring are hindered by the limited access to laboratory ... -
On the power of interleaved low-depth quantum and classical circuits
(University of Waterloo, 2022-09-26)Low-depth quantum circuits are a well-suited model for near-term quantum devices, given short coherence times and noisy gate operations, making it pivotal to examine their computational power. It was already known as early ... -
On the Properties and Structure of Bordered Words and Generalizations
(University of Waterloo, 2022-10-12)Combinatorics on words is a field of mathematics and theoretical computer science that is concerned with sequences of symbols called words, or strings. One class of words that are ubiquitous in combinatorics on words, ... -
On the relationship between satisfiability and partially observable Markov decision processes
(University of Waterloo, 2018-09-26)Stochastic satisfiability (SSAT), Quantified Boolean Satisfiability (QBF) and decision-theoretic planning in finite horizon partially observable Markov decision processes (POMDPs) are all PSPACE-Complete problems. Since ... -
On the Relationship between Sum-Product Networks and Bayesian Networks
(University of Waterloo, 2015-06-08)Sum-Product Networks (SPNs), which are probabilistic inference machines, have attracted a lot of interests in recent years. They have a wide range of applications, including but not limited to activity modeling, language ... -
On the Relationship Between the Developer’s Perceptible Ethnicity and the Evaluation of Contributions in GitHub
(University of Waterloo, 2020-08-28)Context: Open Source Software (OSS) projects are typically the result of collective efforts performed by developers with different backgrounds. Although the quality of developers' contributions should be the only factor ... -
On the Security of Some Variants of RSA
(University of Waterloo, 2007-05-10)The RSA cryptosystem, named after its inventors, Rivest, Shamir and Adleman, is the most widely known and widely used public-key cryptosystem in the world today. Compared to other public-key cryptosystems, such as elliptic ... -
On the Succinct Representation of Equivalence Classes
(University of Waterloo, 2014-12-17)Given a set of n elements that are partitioned into equivalence classes, we study the problem of assigning unique labels to these elements in order to support the query that asks whether the elements corresponding to two ... -
On the Utility of Adding An Abstract Domain and Attribute Paths to SQL
(University of Waterloo, 2018-04-30)Albeit its popularity today, RDBMS and the relational model still have many limitations. For example, one needs to pay premature attention to naming issues in the schema designing phase; and the syntax for conjunctive ... -
On Tolerant Testing and Tolerant Junta Testing
(University of Waterloo, 2020-07-08)Over the past few decades property testing has became an active field of study in theoretical computer science. The algorithmic task is to determine, given access to an unknown large object (e.g., function, graph, probability ... -
On Using Embeddings for Ownership Verification of Graph Neural Networks
(University of Waterloo, 2023-08-11)Graph neural networks (GNNs) have emerged as a state-of-the-art approach to model and draw inferences from large scale graph-structured data in various application settings such as social networking. The primary goal of a ... -
On Using Storage and Genset for Mitigating Power Grid Failures
(University of Waterloo, 2013-04-25)Although modern society is critically reliant on power grids, even modern power grids are subject to unavoidable outages due to storms, lightning strikes, and equipment failures. The situation in developing countries is ... -
An Online Analytical System for Multi-Tagged Document Collections
(University of Waterloo, 2015-12-03)The New York Times Annotated Corpus and the ACM Digital Library are two prototypical examples of document collections in which each document is tagged with keywords and significant phrases. Such collections can be viewed ... -
Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications
(University of Waterloo, 2016-05-18)Probabilistic Graphical Models are often used to e fficiently encode uncertainty in real world problems as probability distributions. Bayesian learning allows us to compute a posterior distribution over the parameters of ... -
Online Monitoring of Distributed Systems Using Causal Event Patterns
(University of Waterloo, 2014-08-11)Event monitoring and logging, that is, recording the communication events between processes, is a critical component in many highly reliable distributed systems. The event logs enable the identification of certain ... -
Online Trace Reordering for Efficient Representation of Event Partial Orders
(University of Waterloo, 2012-01-20)Distributed and parallel applications not only have distributed state but are often inherently non-deterministic, making them significantly more challenging to monitor and debug. Additionally, a significant challenge ... -
OOMatch: Pattern Matching as Dispatch in Java
(University of Waterloo, 2007-09-11)We present a new language feature, specified as an extension to Java. The feature is a form of dispatch, which includes and subsumes multimethods, but which is not as powerful as general predicate dispatch. It is, however, ... -
Open Source Software Evolution and Its Dynamics
(University of Waterloo, 2006)This thesis undertakes an empirical study of software evolution by analyzing open source software (OSS) systems. The main purpose is to aid in understanding OSS evolution. The work centers on collecting large quantities ...