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-
Spring 2016
This thesis applies the Monte Carlo Random Walk method (MRW) to motion planning. We explore different global and local restart strategies to improve the performance. Several new algorithms based on the MRW approach, such as bidirectional Arvand and optimizing planner Arvand*, are introduced and...
-
Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis
DownloadFall 2012
Many problems in digital image processing and analysis can be interpreted as labeling problems, which aim to find the optimal mapping from a set of sites to a set of labels. A site represents a certain primitive, such as a pixel, while a label represents a certain quantity, such as disparity in...
-
Fall 2011
A Social Network or Information Network is a structure made up of nodes representing entities, and edges representing the relationships among nodes. Understanding the behaviour of social networks is known as Social Network Analysis (SNA). One of the most important applications of SNA is to find...