Sciweavers

908 search results - page 73 / 182
» Interactive regret minimization
Sort
View
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 8 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...

Publication
281views
17 years 5 months ago
Modeling Image Textures by Gibbs Random Fields
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...
Georgy Gimel'farb
PERCOM
2006
ACM
16 years 5 months ago
YA-TRAP: Yet Another Trivial RFID Authentication Protocol
Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication a...
Gene Tsudik
PERCOM
2004
ACM
16 years 5 months ago
Anatomy of a Graduate Ubiquitous/Pervasive Computing Course
This paper presents the author's experience in designing and teaching a graduate level Ubiquitous Computing (Ubicomp) course at Arizona State University. It identifies some o...
S. K. S. Gupta
ARCS
2010
Springer
15 years 12 months ago
The JoSchKa System: Organic Job Distribution in Heterogeneous and Unreliable Environments
Abstract. This paper describes a job distribution system which focuses on standard desktop worker nodes in inhomogeneous and unreliable environments. The system is suited for gener...
Matthias Bonn, Hartmut Schmeck