Select a calendar:
Filter February Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for February 02, 2006
-
The Multiplying Potential of People, Technology, and Resources, Dr. J. Khalaifa, Saudi Aramco
Thu, Feb 02, 2006 @ 12:00 PM - 01:00 PM
Mork Family Department of Chemical Engineering and Materials Science
Conferences, Lectures, & Seminars
The Society of Petroleum Engineers 2007 President Elect Dr. J. Al-Khalaifa will be visiting the USC Campus and will be the speaker at the USC SPE Student Chapter meeting.
Location: Hedco Pertroleum and Chemical Engineering Building (HED) - co 116 Petroleum and Chemical Engineering
Audiences: Everyone Is Invited
Contact: iraj ershaghi
-
CS Colloquium
Thu, Feb 02, 2006 @ 03:00 PM - 04:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Prof. Adam MeyersonTitle: Randomized Online Matching Abstract:Consider the problem of assigning consultants to projects. Each consultant should be assigned a project, in such a way that the cost of these assignments is minimized. Cost could represent the travel time of the consultant to the project site, or the ability of the consultant to complete the task. This problem is an instance of the minimum-cost matching problem: one of the most important problems in computer science. Substantial previous work has lead to efficient algorithms to compute these matchings.However, the consultant-assignment problem is naturally online, in that we do not know what the list of projects will be in advance. Projects arrive one-by-one, and as each project appears we must assign a consultant. The requirement that we make assignments as we go, without prior knowledge of the list of projects, makes the problem substantially more difficult. Prior work (by Khuller, Mitchell, and Vazirani) has demonstrated that this problem is intractable if the costs are arbitrary. If the costs form a metric (satisfying symmetry and triangle inequality, for example distances along a sphere) then the best possible deterministic guarantee is that the cost of our matching is at most 2K-1 times the optimum, where K is the number of assignments.In this talk, I will describe the first randomized algorithm for the online matching problem. By using a simple randomized greedy technique combined with prior work in metric embeddings (in particular the result of Fakcharoenphol, Rao, and Talwar), I will guarantee that the cost of our matching is at most
O(log3 K) times the optimum. This talk is based on the paper "Randomized Online Algorithms for Minimum Metric Bipartite Matching" which appeared at SODA 2006, and represents joint work with Akash Nanavati and Laura Poplawski.Bio:Adam Meyerson received his PhD from Stanford University in Fall 2002, with a thesis on approximation algorithms for design of minimum-cost computer networks. He spent the 2002-2003 academic year as a postdoctoral fellow of the Center for Algorithmic Adaptation, Dissemination, and Integration (Aladdin ) at Carnegie-Mellon University. Dr. Meyerson co-organized a series of workshops on integrated logistics ,designed to bring
together researchers from computer science and operations research to discuss applications of facility location problems ranging from warehouse placement to database analysis to network design. He joined the faculty of UCLA in Fall of 2003.Location: TBA
Audiences: Everyone Is Invited
Contact: Nancy Levien
-
USC On The Road
Thu, Feb 02, 2006 @ 06:00 PM - 08:30 PM
Viterbi School of Engineering Alumni
Conferences, Lectures, & Seminars
Join the Alumni Association as they hit the road with some of USC's finest. Scheduled to speak are: Major General Charles Bolden, Jr., USMC (Ret.); Mike Zyda, Director of the USC Viterbi School of Engineering's GamePipe
Laboratory, and Yannis Yortsos, Dean of the USC Viterbi School of Engineering who will give a special presentation on "Creating a Science of Games"Join us at the Intercontinental Houston at
2222 West Loop South
Houston, TX 7702Admission is $20 per person, Hors d'oeuvres and beverages will be servedFor more information call the USC Alumni Association at (213) 740-2300 or visit http://alumni.usc.edu/ontheroad/Location: Houston, TX
Audiences: Everyone Is Invited
Contact: Kirstin Strickland
-
Shakeys Fundraising Night
Thu, Feb 02, 2006 @ 06:00 PM - 09:00 PM
Viterbi School of Engineering Student Organizations
Student Activity
MAES USC Chapter invites students, friends and family to enjoy dinnner at Shakey's Pizza Parlor. Save your receipts and present them to Shakey's for MAES fundraising to recieve a portion of the profit to benefit the MAES student chapter as well as high school mentoring program. For more information, please contact Joel Ulloa at jullo@usc.edu
Location: Shakey's Pizza Parlor
Audiences: Everyone Is Invited
Contact: MAES
