5 search results - page 1 / 1 » A Linear Algorithm for Exact Pattern Matching in Planar Subd... |
SIBGRAPI
2005
IEEE
13 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
CAL
2002
13 years 4 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...