—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where host...