3641 search results - page 6 / 729 » On Computability of Pattern Recognition Problems |
85
Voted
GBRPR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
101
click to vote
SOFSEM
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern re...
95
Voted
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper provides a generalization of non-reducible descriptors by extending the concept of distance between patterns of di erent classes. Generalized non-reducible descriptors ...
121
click to vote
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
For years, researchers in face recognition area have been representing and recognizing faces based on subspace discriminant analysis or statistical learning. Nevertheless, these a...
84
Voted
DAC
2009
ACM
16 years 1 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...