361 search results - page 9 / 73 » Algorithms for Extracting Timeliness Graphs |
RTCSA
2000
IEEE
14 years 1 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Shape skeleton extraction is a fundamental preprocessing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic ...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
ACL
2010
13 years 6 months ago
2010
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...