Sciweavers

2031 search results - page 46 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
14 years 9 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
PR
2002
108views more  PR 2002»
14 years 9 months ago
On deformable models for visual pattern recognition
This paper reviews model-based methods for non-rigid shape recognition. These methods model, match and classify non-rigid shapes, which are generally problematic for conventationa...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
PLILP
1998
Springer
15 years 1 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 1 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
FPL
2009
Springer
100views Hardware» more  FPL 2009»
15 years 1 months ago
A virus scanning engine using a parallel finite-input memory machine and MPUs
This paper presents a virus scanning engine. After showing the difference between ClamAV (an anti-virus software) and SNORT (an intrusion detection software), we show a new archit...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura,...