Vladimir Braverman received a Best Paper Award at FAST ’19

/ February 28, 2019

Load balancing is critical for distributed storage to meet strict service-level objectives (SLOs). It has been shown that a fast cache can guarantee load balancing for a clustered storage system. However, when the system scales out to multiple clusters, the fast cache itself would become the bottleneck. Traditional mechanisms like cache

Read More

Carey Priebe’s paper “On a `Two Truths’ Phenomenon in Spectral Graph Clustering” has been accepted for publication at PNAS

/ February 11, 2019

Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering – clustering the vertices of a graph based on their spectral embedding – is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering composed with either Laplacian or Adjacency spectral embedding (LSE

Read More

QnAs with Donald Geman

/ May 8, 2018

With the proliferation of “omics” technologies, personalized medicine—which tailors treatment to an individual’s genomic profile—promised a revolution in care. That revolution, says applied mathematician Donald Geman, has been slow to arrive. Geman has spent nearly four decades devising statistical methods for a variety of applications. He recently teamed up with an

Read More

Can we teach computers to be digital detectives?

/ May 1, 2018

Imagine standing on the sidewalk of a busy city street, taking in your surroundings. “When you or I look at that scene, we have a task in mind—whether to find a place to eat or shop, the metro station, or a particular person,” says René Vidal, a Johns Hopkins professor of biomedical

Read More