Sciweavers

4036 search results - page 562 / 808
» Formal Methods
Sort
View
TNN
2008
88views more  TNN 2008»
15 years 6 months ago
A New Approach to Knowledge-Based Design of Recurrent Neural Networks
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
Eyal Kolman, Michael Margaliot
SOCO
1998
Springer
15 years 6 months ago
Approximate analysis of binary topological relations between geographic regions with indeterminate boundaries
The development of formal models of spatial relations is a topic of great importance in spatial reasoning, geographic information systems (GIS) and computer vision, and has gained ...
F. Benjamin Zhan
TCAD
2002
121views more  TCAD 2002»
15 years 6 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
ML
2007
ACM
144views Machine Learning» more  ML 2007»
15 years 6 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt
CAP
2010
15 years 1 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman