5599 search results - page 116 / 1120 » Abstract State Services |
119
click to vote
WIA
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
123
click to vote
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
15 years 6 months ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
122
click to vote
SAT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...
114
click to vote
FMCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper addresses the problem of off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of re...