1056 search results - page 73 / 212 » Constraint-Based Graph Matching |
96
Voted
ASAP
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
82
Voted
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
109
Voted
NIPS
2001
15 years 1 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
92
Voted
CAL
2008
15 years 20 days ago
2008
We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state grap...
94
Voted
COMBINATORICS
1999
15 years 7 days ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...