3641 search results - page 26 / 729 » On Computability of Pattern Recognition Problems |
102
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
281
Voted
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
139
Voted
CVPR
2010
IEEE
15 years 16 days ago
2010
IEEE
We consider the `group motion segmentation' problem and provide a solution for it. The group motion segmentation problem aims at analyzing motion trajectories of multiple obj...
106
click to vote
ICDAR
2007
IEEE
15 years 8 months ago
2007
IEEE
The effectiveness of kernel fisher discrimination analysis (KFDA) has been demonstrated by many pattern recognition applications. However, due to the large size of Gram matrix to ...
111
Voted
IJDAR
2000
15 years 2 months ago
2000
: In this paper, we consider the general problem of technical document interpretation, applied to the documents of the French Telephonic Operator, France Telecom. More precisely, w...