Sciweavers

9405 search results - page 335 / 1881
» Computing a Model of Set Theory
Sort
View
155
Voted
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
15 years 12 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
132
Voted
AIIDE
2007
15 years 7 months ago
A Demonstration of ScriptEase Motivational Ambient and Latent Behaviors for Computer RPGs
This demonstration describes the generation of ambient and latent NPC behavior scripts using generative behavior patterns with ScriptEase. Our behavior model supports behavior rol...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...
131
Voted
SACRYPT
1998
Springer
15 years 9 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
ICANN
2010
Springer
15 years 5 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora
126
Voted
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm