3641 search results - page 302 / 729 » On Computability of Pattern Recognition Problems |
161
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose Genetic Algorithms to improve the feature subset selection by combining the valuable outcomes from multiple feature selection methods. This paper also motivates the use...
254
click to vote
ACIVS
2006
Springer
15 years 11 months ago
2006
Springer
Scene understanding is an important problem in intelligent robotics. Since visual information is uncertain due to several reasons, we need a novel method that has robustness to the...
240
click to vote
KI
2010
Springer
15 years 5 months ago
2010
Springer
Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used comput...
213
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
337
click to vote
NLP
2000
15 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...