Browsing Computer Science by Title
Now showing items 215-234 of 1558
-
Complexity Of Atoms Of Regular Languages
(World Scientific Publishing, 2013-11-01)The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ... -
The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques
(University of Waterloo, 2021-08-25)The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at ... -
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
(Springer, 2017-03-06)A language L over an alphabet Σ is suffix-convex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free ... -
The Complexity of Network Design for s-t Eff ective Resistance
(University of Waterloo, 2018-08-23)We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two ... -
Complexity of Proper Prefix-Convex Regular Languages
(Springer, 2017-06-27)A language L over an alphabet Σ is prefix-convex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ... -
Complexity of proper prefix-convex regular languages
(Elsevier, 2019-10-01)A language L over an alphabet Σ is prefix-convex if, for any words x,y,z ∈ Σ*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ... -
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
(Institute of Informatics: University of Szeged, 2017)A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ... -
Complexity of Sublinear Algorithms for Convexity in Higher Dimensions
(University of Waterloo, 2022-07-19)Convexity plays a prominent role in both mathematics and computer science. It is defined for sets and functions, and many related problems can be solved efficiently if the set/function is convex. In this thesis, we focus ... -
Complexity of Suffix-Free Regular Languages
(Elsevier, 2017-11-01)We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ... -
Composer-Centered Computer-Aided Soundtrack Composition
(University of Waterloo, 2006)For as long as computers have been around, people have looked for ways to involve them in music. Research in computer music progresses in many varied areas: algorithmic composition, music representation, music synthesis, ... -
A Comprehensive Study of Declarative Modelling Languages
(University of Waterloo, 2020-07-14)Declarative behavioural modelling is a powerful modelling paradigm that enables users to model system functionality abstractly and formally. An abstract model is a concise and compact representation of key characteristics ... -
The Computational Advantages of Intrinsic Plasticity in Neural Networks
(University of Waterloo, 2019-10-17)In this work, I study the relationship between a local, intrinsic update mechanism and a synaptic, error-based learning mechanism in ANNs. I present a local intrinsic rule that I developed, dubbed IP, that was inspired by ... -
Computational Approaches to Problems in Noncommutative Algebra -- Theory, Applications and Implementations
(University of Waterloo, 2016-09-28)Noncommutative rings appear in several areas of mathematics. Most prominently, they can be used to model operator equations, such as differential or difference equations. In the Ph.D. studies leading to this thesis, ... -
Computational Aspects of Strategic Behaviour in Elections with Top-Truncated Ballots
(University of Waterloo, 2016-07-19)Understanding when and how computational complexity can be used to protect elections against different manipulative actions has been a highly active research area over the past two decades. Much of this literature, however, ... -
Computational Complexity Of Bi-clustering
(University of Waterloo, 2008-08-26)In this work we formalize a new natural objective (or cost) function for bi-clustering - Monochromatic bi-clustering. Our objective function is suitable for detecting meaningful homogenous clusters based on categorical ... -
Computational Complexity of Bi-clustering.
(University of Waterloo, 2007-09-27)Bi-clustering, i.e. simultaneously clustering the rows and columns of matrices based on their entries, covers a large variety of techniques in data mining. The goal of all bi-clustering techniques is finding the partitions ... -
Computational Distinguishability of Quantum Channels
(University of Waterloo, 2009-08-27)The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is ... -
Computational Mechanisms of Language Understanding and Use in the Brain and Behaviour
(University of Waterloo, 2020-10-15)Linguistic communication is a unique characteristic of intelligent behaviour that distinguishes humans from non-human animals. Natural language is a structured, complex communication system supported by a variety of ... -
Computational Methods for Combinatorial and Number Theoretic Problems
(University of Waterloo, 2017-04-27)Computational methods have become a valuable tool for studying mathematical problems and for constructing large combinatorial objects. In fact, it is often not possible to find large combinatorial objects using human ... -
Computational Methods for Maximum Drawdown Options Under Jump-Diffusion
(University of Waterloo, 2011-08-26)Recently, the maximum drawdown (MD) has been proposed as an alternative risk measure ideal for capturing downside risk. Furthermore, the maximum drawdown is associated with a Pain ratio and therefore may be a ...