3641 search results - page 68 / 729 » On Computability of Pattern Recognition Problems |
85
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
75
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
99
Voted
INFORMATICALT
2006
15 years 16 days ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
JUCS
2006
15 years 15 days ago
2006
: The paper concerns the design of evolutionary algorithms and pattern search methods on two circuit design problems: the multi-objective optimization of an Operational Transconduc...
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...