Now showing items 2286-2305 of 3044

    • Question Paraphrase Generation for Question Answering System 

      Qin, Haocheng (University of Waterloo, 2015-08-31)
      The queries to a practical Question Answering (QA) system range from keywords, phrases, badly written questions, and occasionally grammatically perfect questions. Among different kinds of question analysis approaches, the ...
    • Queueing Analysis of a Priority-based Claim Processing System 

      Ibrahim, Basil (University of Waterloo, 2009-10-02)
      We propose a situation in which a single employee is responsible for processing incoming claims to an insurance company that can be classified as being one of two possible types. More specifically, we consider a priority-based ...
    • Quick and Automatic Selection of POMDP Implementations on Mobile Platform Based on Battery Consumption Estimation 

      Yang, Xiao (University of Waterloo, 2014-04-01)
      Partially Observable Markov Decision Process (POMDP) is widely used to model sequential decision making process under uncertainty and incomplete knowledge of the environment. It requires strong computation capability and ...
    • A Quick-and-Dirty Approach to Robustness in Linear Optimization 

      Karimi, Mehdi (University of Waterloo, 2013-01-07)
      We introduce methods for dealing with linear programming (LP) problems with uncertain data, using the notion of weighted analytic centers. Our methods are based on high interaction with the decision maker (DM) and try ...
    • Quotient Complexities of Atoms in Regular Ideal Languages 

      Brzozowski, Janusz; Davies, Sylvie (Institute of Informatics: University of Szeged, 2015)
      A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...
    • Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language 

      Brzozowski, Janusz; Jirásková, Galina; Baiyu, Li; Smith, Joshua (Institute of Informatics: University of Szeged, 2014)
      A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...
    • Quotient Complexity Of Closed Languages 

      Brzozowski, Janusz; Jirásková, Galina; Zou, Chenglong (Springer, 2014-02-01)
      A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...
    • Quotient Complexity of Ideal Languages 

      Brzozowski, Janusz; Jirásková, Galina; Li, Baiyu (Elsevier, 2013-01-28)
      A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ...
    • Quotient Complexity Of Star-Free Languages 

      Brzozowski, Janusz; Liu, Bo (World Scientific Publishing, 2012-09-01)
      The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ...
    • RAMP: RDMA Migration Platform 

      Memon, Babar Naveed (University of Waterloo, 2018-05-16)
      Remote Direct Memory Access (RDMA) can be used to implement a shared storage abstraction or a shared-nothing abstraction for distributed applications. We argue that the shared storage abstraction is overkill for loosely ...
    • Ramsey-nice families of graphs 

      Aharoni, Ron; Alon, Noga; Amir, Michal; Haxell, Penny; Hefetz, Dan; Jiang, Zilin; Kronenberg, Gal; Naor, Alon (Elsevier, 2018-08)
      For a finite family $\cF$ of fixed graphs let $R_k(\cF)$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a monochromatic copy of some $F\in\cF$. We say that $\cF$ ...
    • Random forcing of geostrophic motion in rotating stratified turbulence 

      Waite, Michael L (AIP, 2017-12-29)
      Random forcing of geostrophic motion is a common approach in idealized simulations of rotating stratified turbulence. Such forcing represents the injection of energy into large-scale balanced motion, and the resulting ...
    • Random locations of periodic stationary processes 

      Shen, Jie; Shen, Yi; Wang, Ruodo (Elsevier, 2019-03)
      We consider a family of random locations, called intrinsic location functionals, of periodic stationary processes. This family includes but is not limited to the location of the path supremum and first/last hitting times. ...
    • Randomization and Restart Strategies 

      Wu, Huayue (University of Waterloo, 2006)
      The runtime for solving constraint satisfaction problems (CSP) and propositional satisfiability problems (SAT) using systematic backtracking search has been shown to exhibit great variability. Randomization and restarts ...
    • Randomized quasi-Monte Carlo methods with applications to quantitative risk management 

      Hintz, Erik (University of Waterloo, 2022-05-03)
      We use randomized quasi-Monte Carlo (RQMC) techniques to construct computational tools for working with normal mixture models, which include automatic integration routines for density and distribution function evaluation, ...
    • Ranges of vector states on irreducible operator semigroups 

      Marcoux, L.W.; Omladič, M.; Popov, A.I.; Radjavi, H.; Yahaghi, B. (Springer, 2016)
      Let 𝜑 be a linear functional of rank one acting on an irreducible semigroup S of operators on a finite- or infinite-dimensional Hilbert space. It is a well-known and simple fact that the range of 𝜑 cannot be a singleton. ...
    • Ranked Retrieval in Uncertain and Probabilistic Databases 

      Soliman, Mohamed (University of Waterloo, 2011-01-17)
      Ranking queries are widely used in data exploration, data analysis and decision making scenarios. While most of the currently proposed ranking techniques focus on deterministic data, several emerging applications involve ...
    • Rational approximations on smooth rational surfaces 

      Castañeda Santos, Diana Carolina (University of Waterloo, 2019-08-09)
      In this thesis, we study a conjecture made by D. McKinnon about rational approximations to rational points in algebraic varieties. The conjecture states that if a rational point P on a variety X lies on a rational curve, ...
    • A Ray Optics Framework for the Computation of The Sieve Effect Factor for Blood 

      Northam, Lesley (University of Waterloo, 2010-01-20)
      Light may traverse a turbid material, such as blood, without encountering any of its pigment particles, a phenomenon known as sieve effect. This phenomenon may result in a decrease in the amount of light absorbed by the ...
    • Rayleigh Property of Lattice Path Matroids 

      Xu, Yan (University of Waterloo, 2015-09-22)
      In this work, we studied the class of lattice path matroids $\mathcal{L}$, which was first introduced by J.E. Bonin. A.D. Mier, and M. Noy in [\ref{Bonin 2002}]. Lattice path matroids are transversal, and $\mathcal{L}$ is ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages