Sciweavers

948 search results - page 149 / 190
» What can we achieve by arbitrary announcements
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 8 months ago
Theoretical Properties of Projection Based Multilayer Perceptrons with Functional Inputs
Many real world data are sampled functions. As shown by Functional Data Analysis (FDA) methods, spectra, time series, images, gesture recognition data, etc. can be processed more e...
Fabrice Rossi, Brieuc Conan-Guez
AAMAS
2010
Springer
13 years 9 months ago
Evolutionary mechanism design: a review
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
Steve Phelps, Peter McBurney, Simon Parsons
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
PVLDB
2010
159views more  PVLDB 2010»
13 years 7 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 28 days ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...