Sciweavers

154 search results - page 22 / 31
» The PER Model of Abstract Non-interference
Sort
View
ASIACRYPT
2005
Springer
15 years 3 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
PCI
2005
Springer
15 years 3 months ago
Towards In-Situ Data Storage in Sensor Databases
Abstract. The advances in wireless communications along with the exponential growth of transistors per integrated circuit lead to a rapid evolution of Wireless Sensor Devices (WSDs...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimi...
WINE
2005
Springer
136views Economy» more  WINE 2005»
15 years 3 months ago
Click Fraud Resistant Methods for Learning Click-Through Rates
Abstract. In pay-per-click online advertising systems like Google, Overture, or MSN, advertisers are charged for their ads only when a user clicks on the ad. While these systems ha...
Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Ku...
DAGM
2006
Springer
15 years 1 months ago
Exploiting Low-Level Image Segmentation for Object Recognition
Abstract. A method for exploiting the information in low-level image segmentations for the purpose of object recognition is presented. The key idea is to use a whole ensemble of se...
Volker Roth, Björn Ommer
ALGOSENSORS
2009
Springer
15 years 1 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...