Now showing items 1137-1156 of 1567

    • Query Answering over Functional Dependency Repairs 

      Galiullin, Artur (University of Waterloo, 2013-09-23)
      Inconsistency often arises in real-world databases and, as a result, critical queries over dirty data may lead users to make ill-informed decisions. Functional dependencies (FDs) can be used to specify intended semantics ...
    • Query Evaluation in the Presence of Fine-grained Access Control 

      Zhang, Huaxin (University of Waterloo, 2008-05-20)
      Access controls are mechanisms to enhance security by protecting data from unauthorized accesses. In contrast to traditional access controls that grant access rights at the granularity of the whole tables or views, ...
    • Query Interactions in Database Systems 

      Ahmad, Mumtaz (University of Waterloo, 2013-01-08)
      The typical workload in a database system consists of a mix of multiple queries of different types, running concurrently and interacting with each other. The same query may have different performance in different mixes. ...
    • Query Optimization for On-Demand Information Extraction Tasks over Text Databases 

      Farid, Mina H. (University of Waterloo, 2012-03-27)
      Many modern applications involve analyzing large amounts of data that comes from unstructured text documents. In its original format, data contains information that, if extracted, can give more insight and help in the ...
    • Query Optimization in Dynamic Environments 

      El-Helw, Amr (University of Waterloo, 2012-05-08)
      Most modern applications deal with very large amounts of data. Having to deal with such huge amounts of data is in itself a challenge. This challenge is complicated even more by the fact that, in many cases, this data is ...
    • Query Similarity for Community Question Answering System Based on Recurrent Encoder Decoder 

      Ye, Borui (University of Waterloo, 2017-01-18)
      The measurement of sentence similarity is a fundamental task in natural language processing. Traditionally, it is measured either from word-level or sentence-level (such as paraphrasing), which requires many lexical and ...
    • A Query-Based Approach for the Analysis of Aspect-Oriented Systems 

      Barrenechea, Eduardo (University of Waterloo, 2007-01-29)
      In recent years, many aspect-oriented languages and methods have been proposed in the literature to support separation of concerns that can be spread throughout a software system and its components and to facilitate ...
    • Querying Large Collections of Semistructured Data 

      Kamali, Shahab (University of Waterloo, 2013-10-01)
      An increasing amount of data is published as semistructured documents formatted with presentational markup. Examples include data objects such as mathematical expressions encoded with MathML or web pages encoded with XHTML. ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • Re-encoding Resistance: Towards Robust Covert Channels over WebRTC Video Streaming 

      Cruzat La Rosa, Adrian (University of Waterloo, 2024-01-18)
      Internet censorship is an ongoing phenomenon, where state level agents attempt to control the free access to information on the internet for purposes like dissent suppression and control. In response, research has been ...

      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