3641 search results - page 275 / 729 » On Computability of Pattern Recognition Problems |
202
click to vote
ECCV
2002
Springer
16 years 9 months ago
2002
Springer
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...
169
click to vote
IPL
2002
15 years 7 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
176
click to vote
ICANN
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
193
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
197
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Autoassociator is an important issue in concept learning, and the learned concept of a particular class can be used to distinguish the class from the others. For nonlinear autoass...