Logo: University of Southern California

Events Calendar



Select a calendar:



Filter November Events by Event Type:



Events for November 18, 2008

  • On Campus Freshmen Admission Interviews continue...

    Tue, Nov 18, 2008

    Viterbi School of Engineering Undergraduate Admission

    Receptions & Special Events


    Personal Admission Interviews are available to freshmen applicants throughout the Fall practically every weekday until December 12, 2008. Freshman applicant interviews are not required as part of the admission process, however we would like to meet as many of our applicants as possible. All interview appointments are scheduled online.http://viterbi.usc.edu/admission/freshman/interviews/

    Audiences: Freshmen Applicants for Fall 2009

    Contact: Viterbi Admission

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • Improving deep packet inspection through extended automata

    Tue, Nov 18, 2008 @ 11:00 AM

    Thomas Lord Department of Computer Science

    Conferences, Lectures, & Seminars


    Speaker: Prof. Cristian Estan, University of Wisconsin Host: Prof. Ramesh Govindan Abstract:
    Deep packet inspection is playing an increasingly important role in novel network services. Regular expressions are the language of choice for writing signatures used in deep packet inspection, but standard signature matching solutions are not suitable for high-speed environments. Deterministic finite automata (DFAs) are fast but combining the DFAs for multiple signatures often leads to state space explosion. Non-deterministic finite automata (NFAs) are small but matching can be slow for large signature sets. This talk presents a new solution that simultaneously addresses these problems. Extended finite automata (XFAs) augment deterministic finite automata (DFAs) with finite auxiliary variables and simple instructions that manipulate them. The introduction of auxiliary variables allows us to eliminate state space explosion. In experiments with signature sets used for intrusion prevention by Snort and Cisco Systems, XFAs simultaneously reduce memory and run time by more than an order of magnitude when compared to earlier solutions. Biography:
    Cristian Estan has been an assistant professor in the Computer Sciences Department at University of Wisconsin-Madison since Fall 2004. His Ph.D. is from University of California, San Diego (adviser George Varghese). His research focuses on network security, network traffic measurement, and network traffic analysis. It has resulted in publications in top conferences in networking, security, systems, and databases: SIGCOMM, IEEE Security and Privacy (Oakland), OSDI, SIGMETRICS, ICDE, IMC, etc. His work is supported by multiple grants from NSF including a CAREER grant and gifts from Cisco Systems.

    Location: Charles Lee Powell Hall (PHE) - 223

    Audiences: Everyone Is Invited

    Contact: CS Colloquia

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • On Broadcast Scheduling

    Tue, Nov 18, 2008 @ 04:00 PM

    Thomas Lord Department of Computer Science

    Conferences, Lectures, & Seminars


    Speaker: Prof. Samir Khuller, University of Maryland
    Host: Prof. Leana GolubchikAbstract:
    Broadcasting over a wireless channel is a standard mechanism to disseminate information to a set of clients. Clients request different pieces of information, called "pages", and in this "pull-based" model, the server responds with a broadcast schedule. The key property that distinguishes this problem from standard scheduling is that multiple requests may be satisfied by a single broadcast of the requested page. Surprisingly, this small change makes almost all the problems in this area NP-hard whereas without this property these problems can be solved optimally in polynomial time for unit sized pages. This overlap property arises in other contexts as well such as in multi-query processing.We consider a variety of different objective functions in our work minimizing the sum of response times, minimizing the maximum response time and maximizing the number of satisfied requests when requests have deadlines. This is a survey talk based on several papers and will cover a collection of results using a variety of techniques. Finally we propose some open problems. No background knowledge beyond undergraduate algorithms is expected.Biography:
    Samir Khuller received his M.S and Ph.D from Cornell University in 1989 and 1990, respectively. He spent two years as a Research Associate at the Institute for Advanced Computer Studies (UMIACS) at the University of Maryland, before joining the Computer Science Department in 1992, where he is currently a Professor in the Department of Computer Science. He spent several summers at the IBM T. J. Watson Research Center, and also visited the IBM Tokyo Research Lab for several weeks. From 2004 to 2008 he was the Associate Chair for Graduate Education.His research interests are in graph algorithms, discrete optimization, and computational geometry. He has published about 140 journal and conference papers, and several book chapters on these topics. He is an editor for the journal Networks, International Journal on Foundations of Computer Science, problems Editor for ACM Trans. on Algorithms, and a columnist for SIGACT News. He has served on several program committees.He received the National Science Foundation's Career Development Award, several Dept. Teaching Awards, the Dean's Teaching Excellence Award and also a CTE-Lilly Teaching Fellowship. In 2003, he and his students were awarded the "Best newcomer paper" award for the ACM PODS Conference. He received the University of Maryland's Distinguished Scholar Teacher Award in 2007, as well as a Google Research Award. He graduated at the top of the Computer Science Class from IIT-Kanpur.

    Location: Seaver Science Library (SSL) - 150

    Audiences: Everyone Is Invited

    Contact: CS Colloquia

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • Fall Spotlight on Industrial & Systems Engineering

    Tue, Nov 18, 2008 @ 05:00 PM

    Viterbi School of Engineering Student Affairs

    Workshops & Infosessions


    Interested in learning more about Industrial & Systems Engineering? Come hear from a panel of Viterbi faculty and alumni, industry representatives, and current Viterbi student.Spotlight is a series of workshops held during the fall semester, as part of the First Year Excellence (FYE) and Sophomore Year Connections (SYC) programs. It was created specifically for engineering freshmen and sophomore students who would like to learn more about their programs of study and their departments. Spotlight is a great program for students who are in the process of deciding on a major, or those who may not be certain about the major they have chosen.

    Location: Henry Salvatori Computer Science Center (SAL) - 101

    Audiences: Undergrad, particularly freshmen and sophomores

    Contact: Viterbi Admission & Student Affairs

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • United States Air Force Information Session

    Tue, Nov 18, 2008 @ 06:00 PM - 07:00 PM

    Viterbi School of Engineering Career Connections

    Workshops & Infosessions


    Join representatives of this company as they share general company information and available opportunities.

    Location: Grace Ford Salvatori (GFS) 106

    Audiences: Everyone Is Invited

    Contact: RTH 218 Viterbi Career Services

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File