3641 search results - page 71 / 729 » On Computability of Pattern Recognition Problems |
127
click to vote
KDD
2006
ACM
16 years 29 days ago
2006
ACM
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
100
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
110
Voted
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
131
Voted
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
111
click to vote
MCS
2004
Springer
15 years 6 months ago
2004
Springer
The ECOC framework provides a powerful and popular method for solving multiclass problems using a multitude of binary classifiers. We had recently introduced the Binary Hierarchica...