The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Abstract. Learning ranking functions is crucial for solving many problems, ranging from document retrieval to building recommendation systems based on an individual user’s prefer...
Deciding on web service equivalence in process-aware service compositions is a crucial challenge throughout the composition life cycle. Restricting such decisions to (activity) la...
Stefanie Rinderle-Ma, Manfred Reichert, Martin Jur...