Sciweavers

915 search results - page 63 / 183
» Proof labeling schemes
Sort
View
ESOP
2005
Springer
14 years 1 months ago
Towards a Type System for Analyzing JavaScript Programs
JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a...
Peter Thiemann
AIML
2006
13 years 9 months ago
Deep Sequent Systems for Modal Logic
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
Kai Brünnler
RSA
2011
106views more  RSA 2011»
12 years 10 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
EUROCRYPT
2007
Springer
13 years 12 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
ANNPR
2008
Springer
13 years 10 months ago
Partial Discriminative Training of Neural Networks for Classification of Overlapping Classes
In applications such as character recognition, some classes are heavily overlapped but are not necessarily to be separated. For classification of such overlapping classes, either d...
Cheng-Lin Liu