2687 search results - page 246 / 538 » Formal Analysis of PKCS |
167
click to vote
EP
1998
Springer
15 years 11 months ago
1998
Springer
This paper deals with the representation of document models used in the field of document recognition. A novel formalism called generalized n-gram is presented, which is shown to b...
168
click to vote
ASAP
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
172
click to vote
CALCO
2007
Springer
15 years 10 months ago
2007
Springer
Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an...
174
click to vote
ACL
2006
15 years 8 months ago
2006
We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves b...
145
click to vote
ENTCS
2006
15 years 6 months ago
2006
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...