100 search results - page 16 / 20 » Universal Designated-Verifier Signatures |
CIE
2005
Springer
15 years 3 months ago
2005
Springer
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...
WAIM
2005
Springer
15 years 3 months ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
ICDAR
2003
IEEE
15 years 3 months ago
2003
IEEE
It is generally agreed that an on-line recognition system is always reliable than an off-line one. It is due to the availability of the dynamic information, especially the writing...
POPL
1990
ACM
15 years 1 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
APAL
2008
14 years 10 months ago
2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...