Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
When assessing reported classification results based on selection of members from a database (e.g. a face database), one would like to know what is an achievable classification ra...
In this paper, we propose a robust and efficient algorithm for generalized orthonormal discriminant vectors (GODV). The major advantage of the proposed method is the use of the ra...
The question of fingerprint individuality can be posed as follows: Given a query fingerprint, what is the probability that the observed number of minutiae matches with a template ...
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...