This paper presents a new adaptive graph-cut based move-making algorithm for energy minimization. Traditional move-making algorithms such as Expansion and Swap operate by searchin...
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
In this paper we study the modelling of consensus reaching in a ‘soft’ environment, i.e. when the individual testimonies are expressed as fuzzy preference relations. Here cons...
Mario Fedrizzi, Michele Fedrizzi, Ricardo A. Marqu...
Abstract: Field studies and user requirements analysis are highly valued practices in the human-computer interaction community. However, in companies, field study methods are not w...
Sari Kujala, Marjo Kauppinen, Pia Nakari, Sanna Re...