Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
In this paper, a Euclidean distance based minutia matching algorithm is proposed to improve the matching accuracy in fingerprint verification system. This algorithm extracts match...
Ujjal Kumar Bhowmik, Ashkan Ashrafi, Reza R. Adham...