Sciweavers

2308 search results - page 127 / 462
» Representing Symbolic Reasoning
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 6 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
MICS
2008
103views more  MICS 2008»
15 years 6 months ago
The Freedom to Extend OpenMath and its Utility
Abstract. OpenMath [6] is a standard for representing the semantics of mathematical objects. It differs from Presentation MathML [8] in not being directly concerned with the presen...
James H. Davenport, Paul Libbrecht
PAMI
2010
170views more  PAMI 2010»
15 years 4 months ago
On the Decoding Process in Ternary Error-Correcting Output Codes
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
Sergio Escalera, Oriol Pujol, Petia Radeva
QEST
2010
IEEE
15 years 4 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
CCS
2011
ACM
14 years 6 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...