909 search results - page 39 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
An often overlooked problem in matching lies in selecting an appropriate step size. The selection of the step size for real-time applications is critical both from the point of vi...
136
click to vote
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
109
click to vote
DLOG
2004
15 years 2 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
119
click to vote
CVPR
2007
IEEE
15 years 7 months ago
2007
IEEE
3D human pose recovery is considered as a fundamental step in view-invariant human action recognition. However, inferring 3D poses from a single view usually is slow due to the la...
KCAP
2005
ACM
15 years 6 months ago
2005
ACM
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...