Browsing by Author "Meagher, Karen"

DSpace/Manakin Repository

Browsing by Author "Meagher, Karen"

Sort by: Order: Results:

  • C.V. 
    Meagher, Karen (2014-01-21)
  • Purdy, Alison May (Faculty of Graduate Studies and Research, University of Regina, 2010)
    The Erdős-Ko-Rado Theorem is a fundamental result in extremal set theory. It describes the size and structure of the largest collection of subsets of size k from a set of size n having the property that any two subsets ...
  • Fan, Gaojian (Faculty of Graduate Studies and Research, University of Regina, 2012-07)
    In computational learning theory, concepts are subsets of a set of instances and a concept class is a set of concepts. In many computational learning models, learning algorithms have the goal to identify the target concept ...
  • Borg, Peter; Meagher, Karen (2014-01-21)
  • 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. ...
  • Ahmadi, Bahman; Alinaghipour, Fatemeh; Cavers, Michael; Fallat, Shaun; Meagher, Karen; Nasserasr, Shahla (International Linear Algebra Society, 2013-09)
    The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to ...
  • Sadeqi, Mehdi (Faculty of Graduate Studies and Research, University of Regina, 2014-09)
    Problem solving is a very important aspect of arti cial intelligence. This thesis focuses on problems that can be formulated as search problems in a state space. Since blindly searching in a large state space is usually ...
  • Tessier, Ryan Brett (Faculty of Graduate Studies and Research, University of Regina, 2013-08)
    A sample compression scheme of size k for a concept class C is a pair of functions (f; g) called the compression function and the reconstruction function. The functions have the property that for any sample S consistent ...
  • Meagher, Karen; Fallat, Shaun; Yang, Boting (Elsevier, 2015)
    The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ...
  • Alinaghipour, Fatemeh; Fallat, Shaun; Meagher, Karen (2014)
    The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ...
  • 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; ...