Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...
Abstract In this study we set to investigate visual attention properties of freely behaving barn owls using a miniature wireless camera attached to their heads. The tubular eye str...
Shay Ohayon, Wolf Harmening, Hermann Wagner, Ehud ...
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...