Sciweavers

407 search results - page 20 / 82
» Malleable Proof Systems and Applications
Sort
View
ICTAI
2007
IEEE
14 years 1 months ago
CompoNet: Programmatically Embedding Neural Networks into AI Applications as Software Components
The provision of embedding neural networks into software applications can enable variety of Artificial Intelligence systems for individual users as well as organizations. Previous...
Uzair Ahmad, Andrey Gavrilov, Sungyoung Lee, Young...
NJC
2002
109views more  NJC 2002»
13 years 7 months ago
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
CSFW
2010
IEEE
13 years 11 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
FC
1998
Springer
96views Cryptology» more  FC 1998»
13 years 11 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss
IPPS
2006
IEEE
14 years 1 months ago
Communication concept for adaptive intelligent run-time systems supporting distributed reconfigurable embedded systems
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/ software systems. Since standard processor-based embedded applications have co...
M. Ullmann, J. Becker