Sciweavers

2687 search results - page 276 / 538
» Formal Analysis of PKCS
Sort
View
DAC
1998
ACM
16 years 7 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
ICML
2008
IEEE
16 years 7 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li
ICDAR
2009
IEEE
16 years 1 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
ICDAR
2007
IEEE
16 years 1 months ago
On Using Classical Poetry Structure for Indian Language Post-Processing
Post-processors are critical to the performance of language recognizers like OCRs, speech recognizers, etc. Dictionary-based post-processing commonly employ either an algorithmic ...
Anoop M. Namboodiri, P. J. Narayanan, C. V. Jawaha...
198
Voted
FASE
2005
Springer
16 years 6 days ago
Termination Criteria for Model Transformation
Model Transformation has become central to most software engineering activities. It refers to the process of modifying a (usually graphical) model for the purpose of analysis (by i...
Hartmut Ehrig, Karsten Ehrig, Juan de Lara, Gabrie...