Sciweavers

870 search results - page 31 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
JGAA
2007
135views more  JGAA 2007»
14 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
14 years 7 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
GBRPR
2009
Springer
15 years 4 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
CVPR
2004
IEEE
15 years 11 months ago
How Features of the Human Face Affect Recognition: A Statistical Comparison of Three Face Recognition Algorithms
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...
Geof H. Givens, J. Ross Beveridge, Bruce A. Draper...
ZEUS
2010
180views Communications» more  ZEUS 2010»
14 years 11 months ago
An efficient approach to detect lack of synchronization in acyclic workflow graphs
Control-flow analysis of business process models requires to check the absence of lack of synchronization. We use workflow graphs, which may contain inclusive OR gateways, to repre...
Cédric Favre