Sciweavers

1172 search results - page 106 / 235
» Approximate Reasoning Based on Similarity
Sort
View
ECCV
2010
Springer
15 years 9 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
CADE
1998
Springer
15 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 10 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
ILP
2001
Springer
15 years 9 months ago
Learning Functions from Imperfect Positive Data
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
Filip Zelezný
AUSAI
1999
Springer
15 years 9 months ago
Computing Least Common Subsumers in Expressive Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
Thomas Mantay