338 search results - page 26 / 68 » Using pattern matching for tiling and packing problems |
TPHOL
2003
IEEE
15 years 2 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...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
101
click to vote
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
ECCV
2008
Springer
15 years 11 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...
ICAPR
2005
Springer
15 years 3 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...