26 search results - page 5 / 6 » An Introduction to Grammar Convergence |
CCS
2005
ACM
15 years 3 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
72
Voted
ENTCS
2006
14 years 9 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
FOCI
2007
IEEE
15 years 4 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
DLT
2008
14 years 11 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
IJCAI
1989
14 years 10 months ago
1989
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...