Sciweavers

4066 search results - page 59 / 814
» Almost Complete Sets
Sort
View
ICALP
2005
Springer
14 years 3 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
LPAR
2001
Springer
14 years 2 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
GCB
1998
Springer
112views Biometrics» more  GCB 1998»
14 years 2 months ago
Combining diverse evidence for gene recognition in completely sequenced bacterial genomes
Analysis of a newly sequenced bacterial genome starts with identification of protein-coding genes. Functional assignment of proteins requires the exact knowledge of protein N-term...
Dmitrij Frishman, Andrey A. Mironov, Hans-Werner M...
DAS
2008
Springer
13 years 11 months ago
A Complete Optical Character Recognition Methodology for Historical Documents
In this paper a complete OCR methodology for recognizing historical documents, either printed or handwritten without any knowledge of the font, is presented. This methodology cons...
Georgios Vamvakas, Basilios Gatos, Nikolaos Stamat...
GG
2008
Springer
13 years 11 months ago
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
Hartmut Ehrig, Claudia Ermel