BEGIN:VCALENDAR METHOD:PUBLISH PRODID:-//Apple Computer\, Inc//iCal 1.0//EN X-WR-CALNAME;VALUE=TEXT:USC VERSION:2.0 BEGIN:VEVENT DESCRIPTION:Speaker: Satish Kumar Thittamaranahalli, USC Information Sciences Institute Talk Title: The Constraint Composite Graph and Its Applications Series: Computer Science Colloquium Abstract: The weighted constraint satisfaction problem (WCSP) is a fundamental combinatorial problem with applications in such diverse areas as artificial intelligence, statistical physics, computer vision, and information theory. In this talk, I will present new methods for efficiently solving the WCSP. Central to these methods is the idea of the constraint composite graph (CCG). The CCG provides a unifying computational framework for simultaneously exploiting the structure of the variable-interactions in a given WCSP as well as the structure of the weighted constraints in it. I will present some important applications of the idea of the CCG in kernelization of combinatorial problems, the revival of message passing algorithms, and in other domains (if time permits).\n \n This lecture satisfies requirements for CSCI 591: Research Colloquium. Please note, due to limited capacity in OHE 100D, seats will be first come first serve.\n Biography: Dr. Satish Kumar Thittamaranahalli (T. K. Satish Kumar) leads the Collaboratory for Algorithmic Techniques and Artificial Intelligence at the Information Sciences Institute of the University of Southern California. He has published extensively on numerous topics in Artificial Intelligence spanning such diverse areas as Constraint Reasoning, Planning and Scheduling, Probabilistic Reasoning, Robotics, Combinatorial Optimization, Approximation and Randomization, Heuristic Search, Model-Based Reasoning, Knowledge Representation and Spatio-Temporal Reasoning. He has served on the Program Committees of many international conferences in Artificial Intelligence and is a winner of the 2016 Best Robotics Paper Award and the 2005 Best Student Paper Award from the International Conference on Automated Planning and Scheduling. Dr. Kumar received his PhD in Computer Science from Stanford University in March 2005. In the past, he has also been a Visiting Student at the NASA Ames Research Center, a Postdoctoral Research Scholar at the University of California, Berkeley, a Research Scientist at the Institute for Human and Machine Cognition, a Visiting Assistant Professor at the University of West Florida, and a Senior Research and Development Scientist at Mission Critical Technologies.\n Host: Computer Science Department SEQUENCE:5 DTSTART:20180227T110000 LOCATION:OHE 100D DTSTAMP:20180227T110000 SUMMARY:CS Colloquium: Satish Kumar Thittamaranahalli (USC) – The Constraint Composite Graph and Its Applications UID:EC9439B1-FF65-11D6-9973-003065F99D04 DTEND:20180227T120000 END:VEVENT END:VCALENDAR