Sciweavers

9405 search results - page 45 / 1881
» Computing a Model of Set Theory
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
AAAI
2007
15 years 4 days ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
DIGRA
2003
Springer
15 years 3 months ago
Supporting visual elements of non-verbal communication in computer game avatars
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...
Tomi Kujanpää, Tony Manninen
SEMWEB
2005
Springer
15 years 3 months ago
Modeling the Non-Expected Choice: A Weighted Utility Logit
This work derives and simulates two choice models applying the weighted utility theory, a generalization of the expected utility theory. It shows one set of assumptions, which jus...
Pia Koskenoja
ICFP
2005
ACM
15 years 9 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...