Sciweavers

440 search results - page 88 / 88
» On partial randomness
Sort
View
IACR
2011
128views more  IACR 2011»
12 years 4 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 29 days ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
TMC
2012
11 years 7 months ago
Mobile Data Offloading through Opportunistic Communications and Social Participation
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marat...
SAGA
2007
Springer
13 years 11 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
SIGIR
2012
ACM
11 years 7 months ago
TwiNER: named entity recognition in targeted twitter stream
Many private and/or public organizations have been reported to create and monitor targeted Twitter streams to collect and understand users’ opinions about the organizations. Tar...
Chenliang Li, Jianshu Weng, Qi He, Yuxia Yao, Anwi...