9 search results - page 1 / 2 » Fast Boolean Matching Under Permutation Using Representative |
ASPDAC
1999
ACM
13 years 9 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
DAC
2005
ACM
14 years 5 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
CIVR
2009
Springer
13 years 11 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper proposes a method to recognize 3D object from probed range image under arbitrary pose by fast spherical correlation. First, all view EGIs under different viewpoints are...