65 search results - page 8 / 13 » A Theoretical Comparison of Two Linear Dimensionality Reduct... |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The aim of this paper is to study the fusion at feature extraction level for face and fingerprint biometrics. The proposed approach is based on the fusion of the two traits by extr...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A new emerging field, that of visual stylometry of art, proposes to apply image analysis and machine learning tools to high-resolution digital images of artwork in order to assis...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...