Browsing Computer Science by Title
Now showing items 934-953 of 1544
-
Obedience-based Multi-Agent Cooperation for Sequential Social Dilemmas
(University of Waterloo, 2020-05-14)We propose a mechanism for achieving cooperation and communication in Multi-Agent Reinforcement Learning (MARL) settings by intrinsically rewarding agents for obeying the commands of other agents. At every timestep, agents ... -
Occlusion-Ordered Semantic Instance Segmentation
(University of Waterloo, 2023-08-23)Conventional semantic ‘instance’ segmentation methods offer a segmentation mask for each object instance in an image along with its semantic class label. These methods excel in distinguishing instances, whether they belong ... -
Offline Evaluation via Human Preference Judgments: A Dueling Bandits Problem
(University of Waterloo, 2022-11-22)The dramatic improvements in core information retrieval tasks engendered by neural rankers create a need for novel evaluation methods. If every ranker returns highly relevant items in the top ranks, it becomes difficult ... -
Offset Surface Light Fields
(University of Waterloo, 2003)For producing realistic images, reflection is an important visual effect. Reflections of the environment are important not only for highly reflective objects, such as mirrors, but also for more common objects such as ... -
On Achieving High Survivability in Virtualized Data Centers
(Institute of Electronics, Information and Communication Engineers, 2014-01-01)As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highly-available resources. To achieve this goal, recent proposals have advocated to offer ... -
On Computable Online Learning
(University of Waterloo, 2023-04-27)We initiate a study of computable online (c-online) learning, which we analyze under varying requirements for "optimality" in terms of the mistake bound. Our main contribution is to give a necessary and sufficient condition ... -
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
(University of Waterloo, 2014-09-11)Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has been little work focusing on improving the constant factors ... -
On Decoupling Concurrency Control from Recovery in Database Repositories
(University of Waterloo, 2005)We report on initial research on the concurrency control issue of compiled database applications. Such applications have a repository style of architecture in which a collection of software modules operate on a common ... -
On Design and Evaluation of High-Recall Retrieval Systems for Electronic Discovery
(University of Waterloo, 2017-03-08)High-recall retrieval is an information retrieval task model where the goal is to identify, for human consumption, all, or as many as practicable, documents relevant to a particular information need. This thesis ... -
On Fine-Grained Access Control for XML
(University of Waterloo, 2003)Fine-grained access control for XML is about controlling access to XML documents at the granularity of individual elements or attributes. This thesis addresses two problems related to XML access controls. The first is ... -
On Geometric Range Searching, Approximate Counting and Depth Problems
(University of Waterloo, 2008-09-24)In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching ... -
On Improving Distributed Pregel-like Graph Processing Systems
(University of Waterloo, 2015-07-24)The considerable interest in distributed systems that can execute algorithms to process large graphs has led to the creation of many graph processing systems. However, existing systems suffer from two major issues: (1) ... -
On Integrating Failure Localization with Survivable Design
(University of Waterloo, 2013-05-22)In this thesis, I proposed a novel framework of all-optical failure restoration which jointly determines network monitoring plane and spare capacity allocation in the presence of either static or dynamic traffic. The ... -
On Optimizing Traffic Distribution for Clusters of Network Intrusion Detection and Prevention Systems
(University of Waterloo, 2008-09-02)To address the overload conditions caused by the increasing network traffic volume, recent literature in the network intrusion detection and prevention field has proposed the use of clusters of network intrusion detection ... -
On Reconfiguration Problems: Structure and Tractability
(University of Waterloo, 2015-02-18)Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ... -
On Skin Cyanotic Appearances and Spectral Responses Elicited by Methemoglobinemia and Sulfhemoglobinemia
(University of Waterloo, 2018-07-13)Methemoglobinemia and sulfhemoglobinemia are potentially life-threatening blood disorders characterized by similar symptoms and markedly distinct treatment procedures. In this thesis, we investigate the causal relationship ... -
On the Application of Photoacoustic Absorption Spectral Data to the Modeling of Leaf Optical Properties
(University of Waterloo, 2007-04-27)Due to the importance of plants in the Earth's ecosystem, their photobiological responses have become the subject of extensive research in life sciences. Leaf optical models have been developed to assist in the analysis ... -
On the Bluish Appearance of Veins
(University of Waterloo, 2018-01-18)The bluish appearance of veins located immediately beneath the skin has long been a topic of interest for biomedical optics researchers. Despite this interest, a thorough identification of the specific optical processes ... -
On the Caching Schemes to Speed Up Program Reduction
(University of Waterloo, 2023-01-05)Program reduction is a highly practical, widely demanded technique to help debug language tools, such as compilers, interpreters and debuggers. Given a program P which exhibits a property ψ, conceptually, program reduction ... -
On the Complexity of Reconfiguration of Clique, Cluster Vertex Deletion, and Dominating Set
(University of Waterloo, 2015-07-15)A graph problem P is a vertex-subset problem if feasible solutions for P consist of subsets of the vertices of a graph G. The st-connectivity problem for a vertex-subset problem P takes as input two feasible solutions ...