Conferences underline
Poster Session
Paper 1
Paper 2

Schedule underline

Resources underline
Official Emails
Paper Specs
TA Orientation
Weka Tutorial
Latex Tips
Helpful Links
Paper Presentation Schedule

The following papers have been selected for Oral Presention at CMPUT 603 2007. Our thanks to the CMPUT 603 students for their participation and hard work that have made C603 2007 a great success.

Related Link: Papers Selected for Poster Presentation.

Wed Nov 28
Session Chair: Steve Eliuk
3:00 - 3:20
Hui Wang
Interactive Segmentation via a Graph Cut Optimized Statistical Model Best Paper
3:20 - 3:40
Mojdeh Jalali Heravi
An Evolutionary Rule-based Classification Approach Using Symbiotic Artificial Immune System Best Paper
3:40 - 4:00
Yufeng Shen
Difference Information Based SVM Kernel for Speaker Recognition Runner-up
4:00 - 4:20
Barry Gergel (Best Presentation)
A Study of Prediction Measures for Lossy Image Set Compression Runner-up
Mon Dec 3
Session Chair: Barry Gergel
3:00 - 3:20
Xida Chen
Recovering Object Boundaries from an Image
3:20 - 3:40
Xiaozhou Zhou
Adaptive Multiphase Segmentation Model for Multi-region Segmentation
3:40 - 4:00
Jianzhao Huang
Towards a Scalable Secure Ad Hoc Routing Protocol
4:00 - 4:20
Reza Sadoddin
A New Framework for Network Application Identification Using Machine Learning Techniques
Wed Dec 5
Session Chair: David Schnizlein
3:00 - 3:20
Thomas Eastman
Acquiring Predictive State Representations from Experience in Dynamical Systems
3:20 - 3:40
David Lovi
p-norm Algorithms for Reinforcement Learning
3:40 - 4:00
Mehdi Samadi
Learning from Heuristic Values
4:00 - 4:20
Nick Abou Risk
The Development and Evolution of Competitive Poker-Playing Programs
Thur Dec 6
Session Chair: Amin Jorati
3:00 - 3:20
Babak Behsaz
Improved Approximation Ratio for the Bounded Degree Steiner Tree Problem
3:20 - 3:40
Jordan Patterson
An Overview of Subcellular-Localization Classification Techniques
3:40 - 4:00
Amit Satsangi
Comparing Apples and Oranges—Contrast-set Mining: A Survey
4:00 - 4:20
Marc Gendron-Bellemare (Best Presentation)
On the Complexity of Convex Policies in Partially Observable Markov Decision Processes