Data-intensive applications that operate on large volumes of data have motivated a fresh look at the design of data center networks. The first wave of proposals focused on designi...
Guohui Wang, David G. Andersen, Michael Kaminsky, ...
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...
Dan Li, Chuanxiong Guo, Haitao Wu, Kun Tan, Songwu...
In this paper a novel high-quality reconstruction scheme is presented. Although our method is mainly proposed to reconstruct volumetric data sampled on an optimal Body-Centered Cu...
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...