University of Regina

Probabilistic and decision-theoretic graphical models, such as Bayesian networks, provide compact yet powerful formalisms for building intelligent systems, known as agents in the field of artificial intelligence, that must function in partially...

The main goal of this presentation is to describe an architecture for solving large hybrid Bayesian networks (BNs) with discrete, continuous and deterministic variables. In the presence of deterministic variables, we have to deal with non-existence...

The game-theoretic framework, introduced by Vovk and myself in 2001 (www.probabilityandfinance.com), uses game theory instead of measure theory as a mathematical framework for probability. Classical theorems are proven by betting strategies that...

Graphical models that represent knowledge and uncertainty such as Bayesian networks are popular approaches due to their strong probabilistic semantics and oftentimes intuitive decision modeling capabilities. In this talk, we will examine such...

The concept of entropy was introduced into ergodic theory by Kolmogorov in the late 1950s. It can be viewed as a measure of the average information gained in learning that the orbit of an unidentified point visits a certain sequence of sets in a...

This conference will gather together researchers working in Graphs, Designs and Algebraic Combinatorics. Topics will likely include graphy symmetry, group actions, linear algebra methods and association schemes. Please see the official event webpage...

This workshop will bring together researchers in discrete and combinatorial mathematics from the Prairies. Please see the official event webpage for further information: http://www.math.uregina.ca/~pdmw2011/

On behalf of the 2011 PNRMS Local Organizing Committee: The 5th Annual Meeting of the Prairie Network for Research in the Mathematical Sciences (PNRMS) will be held at Luther College on the University of Regina Campus on April 30, May 1 and 2, 2011...

Graph theory is the study of networks. In many situations, the only way we can study key combinatorial parameters of graphs such as edge-distribution, connectivity or expansion, is by using their eigenvalues. In this talk, I will describe some...

Abstract: Problems in extremal set theory take the form of determining the maximum number of subsets of {1,2, ..., m } you can choose so that the resulting family of subsets has some property. The property I will consider is a trace being forbidden...