This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Abdi Oskouie, Mina
- 2Birkbeck, Neil Aylon Charles
- 2Cai, Zhipeng
- 2Chen, Jiyang
- 2Chowdhury, Md Solimul
- 2Chubak, Pirooz
- 83Machine Learning
- 76Reinforcement Learning
- 42Artificial Intelligence
- 37Machine learning
- 24Natural Language Processing
- 23reinforcement learning
-
Fall 2011
In many cloud computing environments (e.g., Amazon’s public Elastic Computing Cloud and Openstack for private clouds), virtual machine (VM) instances are the unit of resource allocation. When possible, VM instances can be allocated on the same physical server and many techniques (e.g., using...
-
Spring 2010
Skeletonization and segmentation are two important techniques for object representation and analysis. Skeletonization algorithm extracts the “centre-lines” of an object and uses them to efficiently represent the object. It has many applications in various areas, such as computer-aided design,...
-
Fall 2011
Propositional satisability (SAT) has been a dominant tool in solving some practical NP-complete problems. However, SAT also has a number of weaknesses, including its inability to compactly represent numerical constraints and its low level, unstructured language of clauses. In contrast, Constraint...
-
Fall 2011
Pointer analysis is a program analysis that determines the memory locations pointed to by individual pointers. Imprecise pointer information is a major impediment to data-flow analyses and back-end optimizations that depend on pointer information. Most pointer analyses are based on a points-to...
-
Spring 2016
Morphologically complex languages such as Arabic pose several challenges in Natural Language Processing (NLP) due to their complexity and token sparsity. Most techniques approach the problem by transforming the words of the language from their sparse surface form representation to a less sparse...
-
Spring 2015
This thesis consists of two independent projects, each contributing to a central goal of artificial intelligence research: to build computer systems that are capable of performing tasks and solving problems without problem-specific direction from us, their designers. I focus on two formal...
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Fall 2019
Relation Extraction, which is defined as the detection of existing relations between a pair of entities in a sentence, has received a large interest lately, including more recent work on using neural methods. Since neural systems need a large number of annotated sentences to build effective...