3641 search results - page 565 / 729 » On Computability of Pattern Recognition Problems |
125
click to vote
MM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we propose a novel approach for the robust detection and classification of dissolve sequences in videos. Our approach is based on the multi-resolution representati...
119
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
GCB
1997
Springer
15 years 6 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
138
click to vote
ENC
2004
IEEE
15 years 6 months ago
2004
IEEE
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
93
Voted
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we address the use of unified spatial relations for symbol description. We present a topologically guided directional relation signature. It references a unique ...