Pavel Valov, PhD candidate
David R. Cheriton School of Computer Science
Erinn Atwater, PhD candidate
David R. Cheriton School of Computer Science
Philipp Kindermann, Postdoctoral Fellow
David R. Cheriton School of Computer Science
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges.
Corwin Sinnamon, Master’s candidate
David R. Cheriton School of Computer Science
Michael Mior, PhD candidate
David R. Cheriton School of Computer Science
Hamed Haddadi, Senior Lecturer and Deputy Director of Research
Dyson School of Design Engineering
Academic Fellow, Data Science Institute, Imperial College London
Vern Paxson
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
Chief Scientist, Corelight, Inc.
Lead, Networking and Security Group, International Computer Science Institute
Cecylia Bocovich, PhD candidate
David R. Cheriton School of Computer Science
Kshitij Jain, Master’s candidate
David R. Cheriton School of Computer Science
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning "powers'' at the vertices and removing an edge if the sum of the powers at its endpoints is at least its weight. The objective is to minimize the sum of the assigned powers.
Irfan Ahmad, Founder and CEO
CachePhysics
Caches in modern distributed and storage systems must be manually tuned and sized in response to changing application’s workload. A balance must be achieved between cost, performance and revenue loss from cache sizing mis-matches. However, caches are inherently nonlinear systems making this exercise equivalent to solving a maze in the dark.