Sciweavers

9405 search results - page 429 / 1881
» Computing a Model of Set Theory
Sort
View
184
Voted
ICHIM
2001
121views more  ICHIM 2001»
15 years 8 months ago
From Dust to Stardust: A Collaborative 3D Virtual Museum of Computer Science
One of the outcomes of Moore's Law - according to which the exponential growth of technical advances in computer science is pushing more and more of our computers into obsole...
Thimoty Barbieri, Franca Garzotto, Giovanni Beltra...
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 7 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
157
Voted
CCIA
2005
Springer
16 years 12 days ago
Comparison of Strategies Based on Evolutionary Computation for the Design of Similarity Functions
One of the main keys in case-based reasoning system is the retrieval phase, where the most similar cases are retrieved by means of a similarity function. According to the problem, ...
Albert Fornells-Herrera, J. Camps Dausà, El...
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 10 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...