909 search results - page 58 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
121
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
101
click to vote
UAI
1996
15 years 2 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
122
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
107
click to vote
ISCAS
2003
IEEE
15 years 6 months ago
2003
IEEE
A hybrid fingerprint identification system is presented in this paper. The system consists of several steps: fingerprint enhancement, minutiae extraction, texture feature extracti...
100
click to vote
ISMIR
2005
Springer
15 years 6 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...