3172 search results - page 60 / 635 » On the Random-Self-Reducibility of Complete Sets |
105
click to vote
ASWEC
2010
IEEE
15 years 28 days ago
2010
IEEE
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
102
Voted
GCB
1998
Springer
15 years 5 months ago
1998
Springer
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...
111
click to vote
DAS
2008
Springer
15 years 2 months ago
2008
Springer
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...
94
Voted
GG
2008
Springer
2008
Springer
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
15 years 1 months ago
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...
107
Voted
APAL
2007
15 years 26 days ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...