Sciweavers

1087 search results - page 104 / 218
» Distributed Oblivious Transfer
Sort
View
124
Voted
WISEC
2010
ACM
15 years 7 months ago
Privacy-preserving computation of benchmarks on item-level data using RFID
Currently, companies are about to optimize their internal processes by monitoring items they handle with Radio Frequency Identification (RFID). However, there is a risk that sens...
Florian Kerschbaum, Nina Oertel, Leonardo Weiss Fe...
FOCS
2008
IEEE
15 years 3 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
COMCOM
2007
82views more  COMCOM 2007»
15 years 2 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
TCS
2008
15 years 2 months ago
Self-deployment of mobile sensors on a ring
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
MOBISYS
2004
ACM
16 years 2 months ago
Mimic: Raw Activity Shipping for File Synchronization in Mobile File Systems
In this paper, we consider the problem of file synchronization when a mobile host shares files with a backbone file server in a network file system. Several diff schemes have been...
Tae-Young Chang, Aravind Velayutham, Raghupathy Si...