Sciweavers

3641 search results - page 6 / 729
» On Computability of Pattern Recognition Problems
Sort
View
GBRPR
2007
Springer
15 years 3 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
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...
Michel Neuhaus, Horst Bunke
SOFSEM
1998
Springer
15 years 1 months ago
The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
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...
Maciej Gebala
ICPR
2000
IEEE
15 years 1 months ago
Generalized Non-Reducible Descriptors
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 ...
Ventzeslav Valev, Bülent Sankur, Petia Radeva
ICCV
2005
IEEE
15 years 3 months ago
Local Gabor Binary Pattern Histogram Sequence (LGBPHS): A Novel Non-Statistical Model for Face Representation and Recognition
For years, researchers in face recognition area have been representing and recognizing faces based on subspace discriminant analysis or statistical learning. Nevertheless, these a...
Wenchao Zhang, Shiguang Shan, Wen Gao, Xilin Chen,...
DAC
2009
ACM
15 years 10 months ago
Human computing for EDA
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...
Andrew DeOrio, Valeria Bertacco