Upcoming Events

To submit new events to this listing please login or email jensmith@cs.wisc.edu.

Calendar View

  • Thursday, October 30, 2014 - 9:00am to 11:00am
    Chen-Han Ho
    UW-Madison

    Committee: Dr. Karu Sankaralingam (advisor), Dr. Guri Sohi, Dr. Mark Hill, Dr. David Wood, Dr. Nam Sung Kim

  • Thursday, October 30, 2014 - 4:00pm to 5:00pm
    Shira Epstein
    Sector 67

    Shira Epstein will be presenting an open source framework she's designing and implementing that lets people quickly get their AI ideas on to real robots. A central server paired with an overhead webcam runs the April Tags visual tag tracking system, and broadcasts position data wirelessly to each mobile robot on the field. This allows the user to quickly get started programming higher level concepts without worrying about sensor hardware and localization algorithms.

  • Monday, November 3, 2014 - 1:00pm
    Seeun William Umboh
    UW-Madison

    We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple analyses. At the heart of our work is a novel application of embeddings into hierarchically well-separated trees (HSTs) to the analysis of online network design algorithms — we charge the cost of the algorithm to the cost of the optimal solution on any HST embedding of the terminals. This analysis technique is widely applicable to many problems and gives a unified framework for online network design.

  • Wednesday, November 5, 2014 - 7:00pm
    Raissa D'Souza
    UC-Davis, Department of Aerospace & Mechanical Engineering

    The Center for Complexity and Collective Computation (C4) at WID presents the John von Neumann Public Lecture Series in Complexity and Computation, featuring Raissa D'Souza from the Department of Aerospace & Mechanical Engineering at the University of California-Davis.  D'Souza will lead a talk titled, “The Science of Networks: Modeling Our Complex, Interdependent World.”

  • Monday, November 10, 2014 - 1:00pm to 2:00pm
    Pranjal Awasthi
    Princeton University

    We study the problem of learning halfspaces in the malicious noise model of Valiant. In this model, an adversary can corrupt an η fraction of both the label part and the feature part of an example. We design a polynomial-time algorithm for learning halfspaces in R^d under the uniform distribution with near optimal noise tolerance.

    Our results also imply the first active learning algorithm for learning halfspaces that can handle malicious noise.

    Joint work with Nina Balcan and Phil Long.

  • Monday, November 10, 2014 - 4:00pm
    Prof. Krishna V. Palem
    Rice University

    Well over a decade ago, many believed that an engine of growth driving the semiconductor and computing industries, captured nicely by Gordon Moore’s remarkable prophecy (Moore’s law), was speeding towards a dangerous cliff-edge. Ranging from expression of concern to doomsday scenarios, the exact time when serious hurdles would beset us varied quite a bit—some of the more optimistic warnings giving Moore’s law till 2020!

  • Tuesday, November 11, 2014 - 4:00pm
    Mark D. Hill & David Wood
    University of Wisconsin-Madison

    Graphics Processing Units (GPUs) are being re-purposed to perform general-purpose computations as they offer the potential for better performance and and lower energy than conventional CPUs for some workloads. Effective use of GPGPUs, however often requires the programmer and/or runtime software to explicitly manage the logical name (address) and/or physical location of data. It is our hypothesis--shared by some--that GPGPUs can be made more generally effective if all CPU-GPU program threads can access data via a uniform virtual address backed by hardware data movement support.

  • Wednesday, November 26, 2014 - 12:00pm to 1:00pm
    Veljko M. Milutinovic
    University of Belgrade

    This presentation analyses the essence of DataFlow SuperComputing, defines its advantages and sheds light on the related programming model. DataFlow computers, compared to ControlFlow computers, offer speedups of 20 to 200 (even 2000 for some applications), power reductions of about 20, and size reductions of also about 20. However, the programming paradigm is different, and has to be mastered. The talk explains the paradigm, using Maxeler as an example, and sheds light on the ongoing research in the field. Examples include Physics, Engineering, DataMining, FinancialAnalytics, etc.

  • TBD
    Tuesday, December 2, 2014 - 4:00pm
    Hadi Esmaeilzadeh
  • Tuesday, December 9, 2014 - 4:00pm to 5:00pm
    Jayneel Gandhi
    UW Madison

    Virtualization provides value for many workloads, but its cost rises for workloads with poor memory access locality. This overhead comes from translation lookaside buffer (TLB) misses where the hardware performs a 2D page walk (up to 24 memory references on x86-64) rather than a native TLB miss (up to only 4 memory references). The first dimension translates guest virtual addresses to guest physical addresses, while the second translates guest physical addresses to host physical addresses.

  • Thursday, January 29, 2015 - 4:00pm to 5:00pm
    Ben Bederson
    University of Maryland, College Park

    TBA.