Current undergraduate students

Friday, November 18, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Dealing with word sense disambiguation in lexical chaining

Speaker: Mattt Enss

A lexical chain is a sequence of words in a document that are semantically related (i.e., related in meaning). Lexical chains indicate where certain topics or subjects are being discussed in a document. The chains therefore can provide context and be used to determine where topic changes occur.

Friday, November 11, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Beyond integer domains: The all different and global cardinality constraints

Speaker: Claude-Guy Quimper

After giving a brief summary of general principles in constraint programming, we will present two constraints: the all different constraint and the global cardinality constraint.

Friday, November 4, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Structuring interactive cluster analysis

Speaker: Wayne Oldford (Dir. of Computational Math, UW)

The problem of cluster analysis, or finding groups in data, is inherently ill-posed; hence the multitude of different methods which purport to solve "the'' problem. In this talk, a variety of examples illustrate this point and cast doubt on whether a single universally useful clustering method exists.

Friday, October 28, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Who's asking for help? A Bayesian approach to intelligent assistance

Speaker: Bowen Hui (University of Toronto)

Automated software customization is drawing increasing attention as a means to help users deal with the scope, complexity, potential intrusiveness, and ever-changing nature of modern software. The ability to automatically customize functionality, interfaces, and advice to specific users is made more difficult by the uncertainty about the needs of specific individuals and their preferences for interaction.

Friday, October 21, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Why bother about bother: Is it worth it to ask the user?

Speaker: Robin Cohen

In this paper, we discuss the importance of modeling the potential bother to the user, when reasoning about interaction in a mixed-initiative setting. We summarize our previous work on modeling bother as one of the costs of interaction, clarifying how to incorporate this estimated cost when reasoning about whether to initiate interaction.

Friday, October 14, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Ontologies: Mature research tools?

Speaker: Rob Warren

Ontology research has had a renewed interest with the release of two ontological markup standards, DAML+OIL and OWL, in December of 2001 and March of 2002.

In this talk I'll review some of the work I did while at the Fungal Web Project in Montreal, where we faced several questions about the use and adoption of ontologies and their markup languages:

Speaker: Kevin Regan

This paper examines approaches to representing uncertainty in reputation systems for electronic markets with the aim of constructing a decision theoretic framework for collecting information about selling agents and making purchase decisions in the context of a social reputation system.

Friday, September 30, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: A notion of stability for sample-based clustering

Speaker: Shai Ben-David

Clustering is one of the most widely used techniques for exploratory data analysis. Across all disciplines, from social sciences over biology to computer science, people try to get a first understanding of their data by identifying meaningful groups among the data points.

Friday, September 23, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Learning basic block scheduling heuristics from optimal data

Speaker: Tyrel Russell

Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem in instruction scheduling is to find a minimum length schedule for a basic block---a straight-line sequence of code with a single entry point and a single exit point---subject to precedence, latency, and resource constraints. Solving the problem exactly is known to be difficult, and most compilers use a greedy list scheduling algorithm coupled with a heuristic.

Friday, December 15, 2006 11:00 am - 11:00 am EST (GMT -05:00)

AI seminar: Localization with dynamic motion models

Speaker: Adam Milstein

Localization is the problem of determining a s location in an environment. Monte Carlo Localization (MCL) is a method of solving this problem by using a partially observable Markov decision process to find the s state based on its sensor readings, given a static map of the environment. MCL requires a model of each sensor in order to work properly. One of the most important sensors involved is the estimation of the s motion, based on its encoders that report what motion the robot has performed.