Auto-reminder: Upcoming CS Event(s): Weekly Digest
csweb...@usc.edu
Toward flexible, robust, and rapid understanding of user speech in natural language dialogue systems by David DeVault
/*Time and Date*/
3:30:00 PM on 1/18/2011
/*Location*/
SSL 150
/*Details*/
Speaker: Dr. David DeVault, ICT, USC: Natural Language (Dialogue)
Host: Prof. Kevin Knight
Abstract:
This talk presents recent research that targets two of the major limitations in current natural language dialogue systems. One limitation is that while systems face substantial uncertainty in understanding user speech, they usually have only a rudimentary ability to overcome uncertainty in their dialogues. A second and related limitation arises from the fact that human speakers are by n...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1147
-----------------------------------------------------------------------
/*Event*/
An Optimization-Based Framework for Automated Market-Making by Prof. Jenn Wortman
/*Time and Date*/
10:00:00 AM on 1/19/2011
/*Location*/
HNB Auditorium
/*Details*/
Speaker: Prof. Jenn Wortman Vaughan, UCLA (http://www.cs.ucla.edu/~jenn/)
Host: Prof. David Kempe, USC
Abstract:
A prediction market is a financial market designed to aggregate information. To facilitate trades, prediction markets are often operated by automated market makers. The market maker trades a set of securities with payoffs that depend on the outcome of a future event. For example, the market maker might offer a security that will pay off $1 if and only if a Democrat wins the 201...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1166
-----------------------------------------------------------------------
/*Event*/
Electrical Flows and Laplacian Systems: A New Tool for Graph Algorithms by Aleksander Madry, MIT (Faculty Candidate)
/*Time and Date*/
3:30:00 PM on 1/20/2011
/*Location*/
SSL 150
/*Details*/
Speaker: Aleksander Madry, MIT
Host: Prof. David Kempe
Abstract:
In recent years, the emergence of massive computing tasks that arise in context of web applications and networks has made the need for efficient graph algorithms more pressing than ever. In particular, it lead us to focus on reducing the running time of the algorithms to make them as fast as possible, even if it comes at a cost of reducing the quality of the returned solution. This motivates us to expand our algorithmic tool...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1179
-----------------------------------------------------------------------
AUTO-REMINDER of CS EVENTS:
CS Faculty, Student and Staff email lists automatically receive email reminders of CS events. Other members of USC community can place subscription request by sending email to csIT...@usc.edu.
To have your events added to the CS Calendar, please send details to CS Front Desk (frnt...@cs.usc.edu).
http://www.cs.usc.edu/Calendar/
----------