Sciweavers

1772 search results - page 14 / 355
» Classifying Problems into Complexity Classes
Sort
View
STACS
2010
Springer
14 years 23 days ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
ICCBR
2007
Springer
13 years 11 months ago
When Similar Problems Don't Have Similar Solutions
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Stewart Massie, Susan Craw, Nirmalie Wiratunga
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
HICSS
2007
IEEE
117views Biometrics» more  HICSS 2007»
14 years 2 months ago
A Cluster-based Approach to Filtering Spam under Skewed Class Distributions
The purpose of this research is to propose an appropriate classification approach to improving the effectiveness of spam filtering on the issue of skewed class distributions. A cl...
Wen-Feng Hsiao, Te-Ming Chang, Guo-Hsin Hu
MICAI
2010
Springer
13 years 6 months ago
Combining Neural Networks Based on Dempster-Shafer Theory for Classifying Data with Imperfect Labels
This paper addresses the supervised learning in which the class membership of training data are subject to uncertainty. This problem is tackled in the framework of the Dempster-Sha...
Mahdi Tabassian, Reza Ghaderi, Reza Ebrahimpour