University of Cambridge > Talks.cam > Computer Science Research Students mini-conference > Computer Science Research Students mini-conference

Computer Science Research Students mini-conference

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact clphdadm.

The Computer Laboratory is hosting a mini-conference of short research presentations given by research students in the department. The presentations will be of interest to Part II and Part III students, MPhil students as well as other research students, research associates and staff. Topics represent the broad range of research interests in the Computer Laboratory:
12:00 M. Xia “Text Readability Assessment for Second Language Learners”
12:10 T. Brouwer “Bayesian approaches to biological data integration”
12:20 K. Cao “Choose your own (neural) adventure”
12:30 M. Conway “Exploring metabolic networks”
12:40 G. Emerson “Distributional Semantics Beyond Vector Spaces”
12:50 M. Florisson “Alice in Package Hell”
14:00 Y. Liu “A New Face Recognition Algorithm based on Dictionary Learning for a Single Training Sample per Person”
14:10 A. Montanari “Mobile Sensing for Efficient and Accurate Office Analytics”
14:20 B. Nikilesh Dharmaraj “Provenance in user-space”
14:30 C. O’Connell “Software-Defined Radio Eavesdropping on Video Emanations”
14:40 C. Pulte “Verified emulation/decompilation”
14:50 S. Ainsworth “Programmable Prefetching for Irregular Workloads”
15:00 G. Yu ”’Are you following?’: Agency and Expectation in Rhythmic Human-Computer Interaction”
15:10 J. Zhang “Power efficient coding for short range optical network”
15:20 T. Bytheway “Visualising Provenance: Finding the needles in the haystack”
15:30 T. Kispeter “An operational account of concurrent games”

This talk is part of the Computer Science Research Students mini-conference series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity