Sciweavers

344 search results - page 56 / 69
» Some Theorems We Should Prove
Sort
View
ACNS
2009
Springer
121views Cryptology» more  ACNS 2009»
13 years 11 months ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay
DAIS
2003
13 years 8 months ago
Jironde: A Flexible Framework for Making Components Transactional
Abstract. It is generally agreed that one of the key services of componentbased systems are transactions. However, an agreement on how components should be involved in transactions...
Marek Prochazka
AAAI
1994
13 years 8 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 7 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
HICSS
2007
IEEE
181views Biometrics» more  HICSS 2007»
14 years 1 months ago
A Methodology to Evaluate Agent Oriented Software Engineering Techniques
Systems using Software Agents (or Multi-Agent Systems, MAS) are becoming more popular within the development mainstream because, as the name suggests, an Agent aims to handle task...
Chia-En Lin, Krishna M. Kavi, Frederick T. Sheldon...