1651 search results - page 153 / 331 » Measuring the Complexity of Classification Problems |
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
IPL
2008
13 years 8 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
For years, researchers in face recognition area have been representing and recognizing faces based on subspace discriminant analysis or statistical learning. Nevertheless, these a...
AAAI
2010
13 years 9 months ago
2010
Many problems in information extraction, text mining, natural language processing and other fields exhibit the same property: multiple prediction tasks are related in the sense th...
AAAI
1998
13 years 9 months ago
1998
In this paper we extend the concept of exception spaces as defined by Cost and Salzberg (Cost and Salzberg, 1993), in the context of exemplar-based reasoning. Cost et al. defined ...