709 search results - page 68 / 142 » In-stroke word completion |
ENTCS
2006
14 years 12 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,...
ENTCS
2006
14 years 12 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
102
click to vote
ENTCS
2006
14 years 12 months ago
2006
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
IANDC
2006
14 years 12 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
105
click to vote
INFORMATICALT
2008
14 years 12 months ago
2008
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...