Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
To better represent human interactions in social networks, the authors take a network-oriented simulation approach to analyze the evolution of acquaintance networks based on local...
Ranking a number of retrieval systems according to their retrieval effectiveness without relying on costly relevance judgments was first explored by Soboroff et al [6]. Over th...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong,...
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...