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...
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
A noise map facilitates monitoring of environmental noise pollution in urban areas. It can raise citizen awareness of noise pollution levels, and aid in the development of mitigat...
Rajib Kumar Rana, Chun Tung Chou, Salil S. Kanhere...
— Today’s vehicles and on-road infrastructures are equipped with a large number of sophisticated sensory devices. These sensory devices are capable of monitoring and providing ...
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...