Sciweavers

673 search results - page 62 / 135
» Approximate coherence-based reasoning
Sort
View
DLOG
2010
14 years 10 months ago
The Logical Difference For Fuzzy EL+ Ontologies
Abstract. Ontologies undergo changes for reasons such as changes in knowledge, meeting varying application requirements. Thus, for different versions of a considered ontology, it i...
Shasha Feng, Yonggang Zhang, Dantong Ouyang, Haiya...
CISS
2008
IEEE
15 years 6 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 3 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
91
Voted
SWAP
2008
15 years 1 months ago
A Note on the Evaluation of Inductive Concept Classification Procedures
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
IJCAI
2007
15 years 1 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...