Browsing Doctoral Theses and Dissertations by Author "Fallat, Shaun"

DSpace/Manakin Repository

Browsing Doctoral Theses and Dissertations by Author "Fallat, Shaun"

Sort by: Order: Results:

  • Samei, Rahim (Faculty of Graduate Studies and Research, University of Regina, 2015-03)
    In Computational Learning Theory, one way to model a concept is to consider it as a member of the Cartesian products of instances (sets), where each instance may correspond to a binary or multi-valued domain. A concept ...
  • Agasthian, Vijayaparvathy (Faculty of Graduate Studies and Research, University of Regina, 2015-03)
    The convergence of iterative methods for numerically solving the linear systems of equations associated with different types of splittings has been well studied in the literature. In this dissertation, we define new types ...
  • Doucette, Jennifer Lee (Faculty of Graduate Studies and Research, University of Regina, 2012-04)
    The ability of predator populations to expand their ranges and adapt to new environments is often attributed to having a generalist dietary strategy, which is thought to be represented both at the population and individual ...
  • Ahmadi, Bahman (Faculty of Graduate Studies and Research, University of Regina, 2013-07)
    In extremal set theory, the Erd}os-Ko-Rado (EKR) theorem gives an upper bound on the size of intersecting k-subsets of the set {1; : : : ;n}. Furthemore, it classi es the maximum-sized families of intersecting k-subsets. ...
  • Abedini, Ali (Faculty of Graduate Studies and Research, University of Regina, 2014-07)
    Carbon dioxide (CO2) injection processes are among the most promising enhanced oil recovery techniques based on their great potential to improve oil production while utilizing geological storage of carbon dioxide to ...
  • Purdy, Alison May (Faculty of Graduate Studies and Research, University of Regina, 2014-09)
    The Erdös-Ko-Rado theorem, a theorem which gives the size and structure of the largest pairwise intersecting collection of k-subsets from a base set of size n, has inspired many variations on the theme of the maximum ...
  • Alinaghipour Taklimi, Fatemeh (Faculty of Graduate Studies and Research, University of Regina, 2013-08)
    For any simple graph G on n vertices, the (positive semi-de nite) minimum rank of G is de ned to be the smallest possible rank among all (positive semi-de nite) real symmetric n × n matrices whose entry in position (i; ...

Search oURspace


Browse

My Account

About