268 search results - page 20 / 54 » Generalized pattern matching using orbit decomposition |
GBRPR
2005
Springer
15 years 5 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
TPHOL
2003
IEEE
15 years 5 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A...
116
click to vote
PAAPP
2007
14 years 11 months ago
2007
The paper is devoted to the problem of estimating the number of people visible in a camera. It uses as features a portion of foreground pixels in each cell of a rectangular grid. ...
115
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...