A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Abstract. We present a method based on multiresolution signal processing on meshes to create a thickness atlas. We applied this method to construct an atlas of bladder wall thickne...
Sylvain Jaume, Matthieu Ferrant, Andreas Schreyer,...
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...