2944 search results - page 229 / 589 » On Well Quasi-orders on Languages |
198
click to vote
FDL
2004
IEEE
15 years 10 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
165
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
153
click to vote
FINTAL
2006
15 years 10 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
164
click to vote
AUSAI
2003
Springer
15 years 10 months ago
2003
Springer
Hidden markov models (HMMs) and prediction by partial matching models (PPM) have been successfully used in language processing tasks including learning-based token identification. ...
180
click to vote
ECOOPWEXCEPTION
2000
Springer
15 years 10 months ago
2000
Springer
This paper motivates and presents the specification and the implementation of an exception handling system for an dynamically typed object-oriented language. A full object-oriented...