Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
—Recently, mobile social software has become an active area of research and development. A multitude of systems have been proposed over the past years that try to follow the succ...
Marco von Arb, Matthias Bader, Michael Kuhn 0002, ...
In this paper we describe a robust and efficient procedure to detect skin region with homogeneous color values in monocular indoor images. The mathematical background is a functio...
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...