We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
All surfaces can be classified by the conformal equivalence
relation. Conformal invariants, which are shape indices
that can be defined intrinsically on a surface, may
be used t...
Paul M. Thompson, Tony F. Chan, Xianfeng Gu, Yalin...
Abstract. We investigate new approaches to quantifying the white matter connectivity in the brain using Diffusion Tensor Magnetic Resonance Imaging data. Our first approach finds a...
Lauren O'Donnell, Steven Haker, Carl-Fredrik Westi...
This paper is based on our exploratory study of a South Indian village in Chamrajanagar district of Karnataka. The study was to understand the rural communication environment and ...
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...