In this paper we consider the problem of securely outsourcing computation on private data. We present a protocol for securely distributing the computation of the data structures u...
Carlo Blundo, Emiliano De Cristofaro, Aniello Del ...
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
Although directory-based cache coherence protocols are the best choice when designing chip multiprocessor architectures (CMPs) with tens of processor cores on chip, the memory ove...
We propose a novel approach to service choreography through a typed process calculus that features an event notification paradigm for coordinating distributed components (e.g., se...
Participatory search can be defined as a search service framework where each participant takes care of gathering information and contributing indexes to a central location where t...
Giuseppe Attardi, Andrea Esuli, Lucian Hancu, Mari...