Seminar

Charles Perin, Department of Computer Science
City, University of London

We live in an increasingly data-driven world, where commercial, societal, environmental, and political decisions are made based on data. However, we also live in a world where most people lack the literacy required to participate in the data-informed debates of modern society. Perhaps the main barrier to improving people’s data literacy is that data is often associated with complexity, large scale, corporatism, and dystopia.

But data is about people.

Haifeng Xu, PhD candidate
Computer Science Department, University of Southern California

Strategic interactions among self-interested agents (a.k.a., games) are ubiquitous, ranging from economic activity in daily life and the Internet to defender-adversary interactions in national security. A key variable influencing agents' strategic decision making is the information they have available about their environment as well as the preferences and actions of others. 

Please note: This seminar has been cancelled

Thomas Steinke, Postdoctoral researcher
IBM Almaden Research Center, San Jose, California

As data is being more widely collected and used, privacy and statistical validity are becoming increasingly difficult to protect. Sound solutions are needed, as ad hoc approaches have resulted in several high-profile failures.

Cong Guo, PhD candidate
David R. Cheriton School of Computer Science

Consolidation of multiple workloads is cost-effective for system operators. However, it is difficult to determine how to share resources among multiple tenants to achieve both performance isolation and work conservation. The primary shared resource in the server are the CPU cores. We show that current solutions cannot handle CPU sharing very well in various multi-tenancy scenarios.

Chenyan Xiong, PhD candidate
Carnegie Mellon University

Search engines and other information systems have started to evolve from retrieving documents to providing more intelligent information access. However, the evolution is still in its infancy due to computers’ limited ability in representing and understanding human language. 

Wednesday, April 4, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

PhD Seminar • Algorithms and Complexity: Succinct Color Searching in One Dimension

Hicham El-Zein, PhD candidate
David R. Cheriton School of Computer Science

We present succinct data structures for one-dimensional color reporting and color counting problems. We are given a set of $n$ points with integer coordinates in the range $[1,m]$ and every point is assigned a color from the set $\{\,1,\ldots,\sigma\,\}$. A color reporting query asks for the list of distinct colors that occur in a query interval $[a,b]$ and a color counting query asks for the number of distinct colors in $[a,b]$.