3641 search results - page 350 / 729 » On Computability of Pattern Recognition Problems |
163
click to vote
CIARP
2009
Springer
15 years 11 months ago
2009
Springer
This paper gives an overview of works done in our group on 3D and appearance modeling of objects, from images. The backbone of our approach is to use what we consider as the princi...
147
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...
198
click to vote
CCECE
2006
IEEE
15 years 11 months ago
2006
IEEE
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
151
click to vote
STACS
2009
Springer
15 years 12 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
122
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...