1772 search results - page 142 / 355 » Classifying Problems into Complexity Classes |
159
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
179
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
A problem of using mixture-of-Gaussian models for unsupervised texturesegmentationisthat "multimodal"textures(such ascan often be encountered in natural images) cannot b...
156
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
177
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the dat...
194
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...