3641 search results - page 94 / 729 » On Computability of Pattern Recognition Problems |
92
Voted
ADMA
2006
Springer
15 years 6 months ago
2006
Springer
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
128
click to vote
ICDAR
2011
IEEE
14 years 7 days ago
2011
IEEE
—This paper proposes a method for low resolution QR-code recognition. A QR-code is a two-dimensional binary symbol that can embed various information such as characters and numbe...
113
click to vote
PR
2006
15 years 17 days ago
2006
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer...
126
Voted
ISVC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a method for the fast and accurate computation of the local cross-correlation of 3D vectorial data. Given spherical patches of 3D vector fields, our meth...
93
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...