Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
—Ensuring spontaneous ad hoc interoperation in decentralized ubiquitous computing environments is challenging, because of heterogeneous resources and divergent policies. Centrali...
Venkatraman Ramakrishna, Peter L. Reiher, Leonard ...
We consider a swarm of robots equipped with an infrared range and bearing device that is able both to make estimates of the relative distance and angle between two robots in line-o...
Gianni A. Di Caro, Frederick Ducatelle, Luca Maria...
– Networked enterprises create virtual teams of distributed experts belonging to different enterprises where one user can be part of multiple teams; How to effectively control th...
Ahmad Kamran Malik, Hong Linh Truong, Schahram Dus...