4302 search results - page 240 / 861 » Index Pairs Algorithms |
132
click to vote
SAC
2011
ACM
14 years 3 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
A major approach for fingerprint recognition today is to extract minutiae from fingerprint images and to perform fingerprint matching based on the number of corresponding minutiae ...
100
Voted
CONIELECOMP
2009
IEEE
15 years 7 months ago
2009
IEEE
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...
117
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...
113
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...