SearchSkip to Search Results
- 1Elmallah, Ehab
- 1Enright, Jessica Anne
- 1Goldenberg, Mark.
- 1Kouritzin, Michael A.
- 1Neufeld, Kenton R
- 1Newton, F.
- 4Graduate Studies and Research, Faculty of
- 4Graduate Studies and Research, Faculty of/Theses and Dissertations
- 1Computing Science, Department of
- 1Computing Science, Department of/Technical Reports (Computing Science)
- 1Mathematical and Statistical Sciences, Department of
- 1Mathematical and Statistical Sciences, Department of/Research Publications (Mathematical and Statistical Sciences)
The purpose of this study is to describe a methodology to recover the model (cognitive and item models) from generated test items using a novel graph theory approach. Beginning with the generated test items and working backward to recover the original model (cognitive and item models) using a...
A new class of discrete random fields designed for quick simulation and covariance inference under inhomogenous conditions is introduced and studied. Simulation of these correlated fields can be done in a single pass instead of relying on multi-pass convergent methods like the Gibbs Sampler or...
Improving our ability to assess the impacts of hydrologic alteration on stream fishes: An interdisciplinary approach to assess the Threatened Western Silvery Minnow Hybognathus argyritis in CanadaDownload
Human induced hydrologic alteration is ubiquitous in North American riverscapes. These alterations have been shown to impact fishes by modifying habitats, influencing movement patterns and driving changes in community structure. Understanding these impacts is an essential first step for the...
Technical report TR95-03. For any fixed integer k >= 2, define the class of k-polygon graphs as the intersection graphs of chords inside a convex k-polygon, where the endpoints of each chord lie on two different sides. The case where k=2 is degenerate; for our purpose, we view any pair of...
A set representation of a graph is an assignment of sets to vertices such that two vertices are adjacent if and only if their assigned sets have some specified relationship. We give several results related to set representations of graphs. We show that recognising the overlap and intersection...