Sciweavers

3164 search results - page 203 / 633
» On Granular Knowledge Structures
Sort
View
CADE
2006
Springer
16 years 4 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
CIARP
2007
Springer
15 years 10 months ago
Learning in Computer Vision: Some Thoughts
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...
Maria Petrou
FLAIRS
2006
15 years 5 months ago
Model Construction Algorithms for Object-Oriented Probabilistic Relational Models
This paper presents three new algorithms for the automatic construction of models from Object Oriented Probabilistic RelationalModels. The first two algorithms are based on the kn...
Catherine Howard, Markus Stumptner
EACL
1989
ACL Anthology
15 years 5 months ago
Enhancing Explanation Coherence With Rhetorical Strategies
This paper discusses the application of a previously reported theory of explanation rhetoric (Maybury, 1988b) to the task of explaining constraint violations in a hybrid rule/fram...
Mark T. Maybury
JCIT
2010
95views more  JCIT 2010»
14 years 11 months ago
Measuring Concept Similarity of Heterogeneous Ontologies in Multi-angent System
Different kinds of agents in a multi-agent system have different knowledge structure, which results in difficulties of interaction and coordination among agents. At present, ontol...
Chenming Li, Lizhong Xu, Chunxia Yu, Xiaodong Wei