Sciweavers

1172 search results - page 67 / 235
» Approximate Reasoning Based on Similarity
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 10 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
TABLEAUX
2007
Springer
14 years 3 months ago
Axiom Pinpointing in General Tableaux
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing ...
Franz Baader, Rafael Peñaloza
EWCBR
2008
Springer
13 years 10 months ago
Back to the Future: Knowledge Light Case Base Cookery
The domain of cookery has been of interest for Case-Based Reasoning (CBR) research for many years since the CHEF case-based planning system in the mid 1980s. This paper returns to ...
Qian Zhang, Rong Hu, Brian Mac Namee, Sarah Jane D...
WACV
2008
IEEE
14 years 3 months ago
Object Categorization Based on Kernel Principal Component Analysis of Visual Words
In recent years, many researchers are studying object categorization problem. It is reported that bag of keypoints approach which is based on local features without topological in...
Kazuhiro Hotta
EWCBR
2004
Springer
14 years 24 days ago
MINLP Based Retrieval of Generalized Cases
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
Alexander Tartakovski, Martin Schaaf, Rainer Maxim...