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...
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Light spectroscopic methods are critical to advances in molecular characterization of disease processes. However, these methods have been limited to in-vitro or cell culture studi...
David Hattery, Moinuddin Hassan, Stavros Demos, Am...
In most electronic auctions conducted over the Internet today price is still the only decision criteria for the best bid. This is true for all sorts of auctions in the electronic ...
Birgit Burmeister, Tobias Ihde, Thomas Kittsteiner...