Sciweavers

578 search results - page 12 / 116
» On effective presentation of graph patterns: a structural re...
Sort
View
EURODAC
1995
IEEE
137views VHDL» more  EURODAC 1995»
13 years 11 months ago
A formal non-heuristic ATPG approach
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
Manfred Henftling, Hannes C. Wittmann, Kurt Antrei...
GBRPR
2007
Springer
14 years 1 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
SIBGRAPI
2005
IEEE
14 years 1 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
HICSS
2007
IEEE
140views Biometrics» more  HICSS 2007»
14 years 2 months ago
Design Pattern Evolution and Verification Using Graph Transformation
This paper presents a graph transformation based approach to design pattern evolution. An evolution of a design pattern includes modifications of pattern elements, such as classes...
Chunying Zhao, Jun Kong, Kang Zhang
DASFAA
2005
IEEE
166views Database» more  DASFAA 2005»
14 years 1 months ago
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
Chuan Li, Changjie Tang, Jing Peng, Jianjun Hu, Yo...