Computer Science

CATS (Spring 2004)

Date	Speaker	Talk
January
1/16/04	Ramyaa	``Godel's Incompleteness Theorem''
1/23/04	Yinglei Song	`` Memory efficient RNA pseudoknot prediction with stochastic grammar modeling''
1/30/04	Rod Canfield	`` Space complexity of path-finding in graphs ''
February
2/06/04	William Biggs	``Implementing AI in video games''
2/13/04	Xingzhi Luo	``If P = NP then EXP = NEXP''
2/20/04	Angela Maduko	``Exact TSP is DP-complete''
2/27/04	Kaan Tariman	``Genetic Algorithms for SCFG estimation''
March
3/05/04	Boris Alexeev	``Minimal DFAs for testing divisibility''
3/12/04	(no speaker)	(spring break)
3/19/04	Sujeeth Thirumalai	``Neighbourhood broadcasting scheme for star interconnection networks''
3/26/04	Liang Shi	``Multi-objective GA optimization using reduced models''
April
4/02/04	Chunmei Liu	``Noncoding RNA gene detection using comparative sequence analysis''
4/09/04	Minal Agrawal	``SCFG modeling for pseudoknots from aligned RNA sequences of known structures''
4/16/04	Kan Liu	``An improved SCFG-based algorithm for RNA secondary structure prediction''
4/23/04	Junfeng Qu	``One-way functions''