4137 search results - page 162 / 828 » On the number of matchings of a tree |
178
click to vote
DSD
2005
IEEE
15 years 8 months ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
182
click to vote
FLAIRS
2004
15 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
165
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
181
click to vote
IJCAI
2003
15 years 8 months ago
2003
Using an open-source, Java toolkit of name-matching methods, we experimentally compare string distance metrics on the task of matching entity names. We investigate a number of dif...
174
click to vote
BMVC
1998
15 years 8 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...